=(j&tmp))sum++; } printf("%d" &numb); int i=1; int j=0x1; int sum=0; while(i++<16){ tmp=numb; scanf("%d" count);} ||| 测试通过 =0x80;j<<=1) if((j&numb) 谢谢采用我的题int main(){ int tmp=0; int numb=0; scanf("%d" value1.count()); count += value1.count(); value1 = value2; printf("/n"); } printf("%d/n" 2)); printf("%d/n" buf itoa(value1.to_ulong() 2)); value1 ^= value2; printf("%8s/n" buf itoa(value2.to_ulong() 2)); printf("%8s/n" buf itoa(value1.to_ulong() value2; srand(time(NULL)); value1 = bitset<8>(rand() % 256); for(int i=1; i< 16; i++) { value2 = bitset<8>(rand() % 256); printf("%8s/n" #include <stdio.h>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;main(){ int count; char buf[215]; count = 0; bitset<8> value1 sum);} &numb); for(j=0x1;j