//输入两个整数m和n, 计算需要改变m的二进制表示中的多少位才能得到n. int changeNumber(int m, int n) { int t = m ^ n; return NumberOf1_3(t); }
int main(int argc, const char * argv[]) { // insert code here... printf("Hello, World!\n"); int x; scanf("%d",&x); printf("NumberOf1_1(x):%d\nNumberOf1_2(x):%d\nNumberOf1_3(x):%d\n",NumberOf1_1(x),NumberOf1_2(x),NumberOf1_3(x)); printf("%d\n",isTwo(x)); printf("%d\n",changeNumber(10, 13)); return 0; }
int main() { //int i = 9; int i = 0x7FFFFFFF; printf("%d\n",NumberOf1_3(i)); }