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