//方法:首先让两个数异或,再统计其中的二进制中的1
int Bin_count_number(int m, int n)
{
int count = 0;
int a = m^n;
while (n)
{
if (a%1==1)
{
count++;
}
a = a / 2;
}
return count;
}
int main()
{
int m = 15;
int n = 28;
/*scanf("%d%d", &m, &n);*/
int count = Bin_count_number(m, n);
printf("%d", count);
return 0;
}