Codeforces Round #443 (Div. 2) C. Short Program
来源:互联网 发布:苹果狙击镜软件 编辑:程序博客网 时间:2024/06/07 05:39
传送门
题意:就是给你n个操作,然后化简,在5步之内输出跟n步操作同样效果的操作。
做法:很容易想到,最后一定用三种操作 &|^能表示完所有的操作。
然而x不知道是0还是1,那么最后就看假如x是0,x变成什么值,y是1,y变成什么值,
由什么操作可以得来就好了。
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-./// __.' ~. .~ `.__/// .'// \./ \\`./// .'// | \\`./// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`./// .'//.-" `-. | .-' "-.\\`./// .'//______.============-.. \ | / ..-============.______\\`./// .'______________________________\|/______________________________`.#pragma comment(linker, "/STACK:1024000000,1024000000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=3e5+10;const int maxx=1e3+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;int cal(int a,int i){ if(a&(1<<i)) return 1; return 0;}int n;void solve(){ s_1(n); int x=0,y=1023; W(n--) { char c[2]; int t; scanf("%s %d", c, &t); if(c[0]=='|') x|=t,y|=t; if(c[0]=='&') x&=t,y&=t; if(c[0]=='^') x^=t,y^=t; } int v1=0,v2=0,v3=0; FOr(0,10,i) { if(!cal(x,i)&&cal(y,i)) v2+=(1<<i);// |0 &1 ^0 if(cal(x,i)&&cal(y,i)) v3+=(1<<i);// |0 &0 ^1 if(cal(x,i)&&!cal(y,i)) v3+=(1<<i);// |0 &1 ^1 } printf("3\n"); printf("| %d\n", v1); printf("& %d\n", v2); printf("^ %d\n", v3);}int main(){ //freopen( "in.txt" , "r" , stdin ); //freopen( "data.txt" , "w" , stdout ); int t=1; //init(); //s_1(t); for(int cas=1;cas<=t;cas++) { //printf("Case #%d: ",cas); solve(); }}
阅读全文
0 0
- Codeforces Round #443 (Div. 2): C. Short Program
- Codeforces Round #443 (Div. 2) C Short Program
- Codeforces Round #443 (Div. 2) C. Short Program
- Codeforces Round #443 (Div. 2) C. Short Program
- Codeforces Round #443 (Div. 2) C. Short Program 【模拟】
- Codeforces Round #879 (Div. 2) C. Short Program
- Codeforces Round #443(Div.2) C.Short Program(位运算+思维)
- Codeforces #443 Div.2 C. Short Program 【位操作】
- Codeforces Round #443 (Div. 1) A. Short Program
- Codeforces 879C Short Program【思维】
- CF #443 C Short Program
- 【codeforces】Codeforces Round #370 (Div. 2) C
- Short Program CodeForces
- Codeforces Round #443 (Div. 2)
- Codeforces Round #443 (Div.2)
- Codeforces Round #443 (Div. 2)
- Codeforces Round #443 (Div.2)
- Codeforces Round #443 (Div.2)
- NPR的一些总结
- 初学java:一球从100米高度自由落下,每次落地后反跳回原高度的一半,再落下,求它在第10次落地时,共经过多少米?第10次反弹多高?
- W3school的Html5新标签
- 获取NavigationView中的menu,改变menu子item的属性
- mysql查询上月记录数
- Codeforces Round #443 (Div. 2) C. Short Program
- neon优化二维卷积算法
- JAVA运算符优先级概念
- 多任务学习“Exploiting Multi-Grain Ranking Constraints for Precisely Searching Visually-similar Vehicles”
- scrapy爬虫注意点(2)—— 根据page循环遍历页面参数问题
- unity5 GI全局光照 问题集锦解答
- 曹可爱之最可爱-Vue.js入门(三)模版语法
- 如何给bigdecimal保留小数位
- C#中关闭第一个Form窗口,打开另一个新窗口方法