.编程实现： 两个int（32位）整数m和n的二进制表达中，有多少个位(bit)不同

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/weixin_45663523/article/details/102616191

1、.编程实现：
两个int（32位）整数m和n的二进制表达中，有多少个位(bit)不同？
输入例子:
1999 2299
输出例子:7
2、程序：

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
int Judge_differ_bit(unsigned int num1, unsigned int num2);
int main()
{
	printf("input two number:");
	int num1,num2;
	scanf("%d %d", &num1,&num2);
	//Judge_differ_bit(num1, num2);
	printf("%d", Judge_differ_bit(num1, num2));
 system("pause");
 return 0;
}
int Judge_differ_bit(unsigned int num1, unsigned int num2)
{
	int count1 = 0, count2 = 0,i,j,m=0,n=0,q=0,l=0,temp=0;
	int a1[32] = { 0 };
	int a2[32] = { 0 };
	int b1[32] = { 0 };
	int b2[32] = { 0 };
	while (num1)
	{
		a1[count1] = num1 % 2;
		num1 = num1 / 2;
		count1++;
	}
	for (i = count1; i >= 0; i --)
	{
		printf("%d", a1[i]);
		b1[m] = a1[i];
		m++;
	}
	printf("\n");
	while (num2)
	{
		a2[count2] = num2 % 2;
		num2 = num2 / 2;
		count2++;
	}
	for (j = count2; j >= 0; j --)
	{
		printf("%d", a2[j]);
		b2[n] = a2[j];
		n++;
	}
	printf("\n");
	
	for (l = 0; l < 32; l++)
	{
		if (b1[l] != b2[l])
		{
			q++;
		}
	}
	return q;
}

3、结果：