位运算

#include #include using namespace std; int abs1(int x) {

int y; y=x>>31;

return (x+y)^y; }

void print(int x) { int p[32]; int top=0,i; if(x<0) { cout<<\"-\"; x=abs1(x); } while(x!=0) { p[top++]=x%2; x/=2; } for(i=top; i>=1; i--) cout<int sign(int x) { return x>>31|(unsigned(-x))>>31; }

unsigned B2G(unsigned B ) {

return B ^ (B>>1) ; }

unsigned G2B(unsigned G) { unsigned B; B=G^(G>>1);

B=G^(G>>2); B=G^(G>>4); B=G^(G>>8); B=G^(G>>16); return B; }

int avg(int x, int y) { return (x&y)+((x^y)>>1); }

void Swap(int &x, int &y) { x=x^y; y=y^x; x=x^y; }

bool pow2(int x) { return ((x&(x-1))==0&&(x!=0)); }

int findchess(int x, int y, int k) { int re=0; int i; for(i=y; i<=x; i++) { re+=((k>>(i-1))&1); } return re; }

int findc(int x) { int i; int re=0; for(i=31; i>=0; i--) { re+=(x>>i&1); } return re; }

int main() {

int x,y;

while(cin>>x>>y) { cout<<(x>>3)<>x>>y; print(x); print(y); x=(x^(x+1))>>1; print(x); }

return 0; }