题目:进制转换,统计二进制中1的个数。
分析:简单题。mod 2取余逆序输出。
#include <iostream>
#include <cstdlib>
using namespace std;
int bit[65];
int main()
{
int n;
while ( cin >> n && n ) {
int count = 0,sum = 0;
while ( n ) {
bit[count] = n%2;
n >>= 1;
sum += bit[count];
count ++;
}
cout << "The parity of ";
do {
cout << bit[-- count];
}while ( count > 0 );
cout << " is " << sum << " (mod 2)." << endl;
}
return 0;
}