http://acm.pku.edu.cn/JudgeOnline/problem?id=3748
题目虽然简单,
但从Killua牛牛那学到点东西,
bitset这个类库....
用了bitset后看看代码
是不是很简洁....
#include<iostream> #include<bitset> using namespace std; int main() { int n,x,y; while(scanf("%x,%d,%d",&n,&x,&y)!=EOF) { bitset<32> bit(n); bit.set(x,0); bit.set(y,1); bit.set(y-1,1); bit.set(y-2,0); printf("%x/n",bit.to_ulong()); } return 0; }