题解 | #两个整数二进制位不同个数#
两个整数二进制位不同个数
https://www.nowcoder.com/practice/16e48900851646c0b2c6cdef9d7ea051
#include<stdio.h>
int main()
{
int n, m = 0;
scanf("%d%d", &n, &m);
int count = 0;
int sum = n ^ m;
for (int i = 0; i < 32; i++)
{
if (sum & (1 << i))
count++;
}
printf("%d", count);
return 0;
}
