C++求2进制01不同的位数

#include <iostream> using namespace std; int Grial(int x,int y) { int count = 0; while(x!=0 || y!=0) { if( ((x&0x1) ^ (y&0x1)) ) count++; x>>=1; y>>=1; } return count; } int main() { cout<<Grial(2,15)<<endl; return 0; }