輸入兩個整數值，判斷兩個整數哪一位比特不同，

1. #include <stdio.h>
   #include <stdlib.h>
   
   //顯示兩個整數int哪一個比特值不同
   void  CountBitDiff(int n, int m) {
       int a[8] = {0};
       int b[8] = {0};
       for(int i = 0; i < 8; i++) { 
           a[i] = (n>>i)&1;
       }
       for(int i = 0; i < 8; i++) { 
          b[i] = (m>>i)&1;
       }
       for(int i = 0; i < 8; i++) {
           if(a[i] ^ b[i]) {
               printf("int8數據第幾位不同：%d\t", i); 
               printf("int8數據那一位變成：%d\n",b[i]);    
           }
       }
       printf("\n");
   }
   
   int main()
   {
       int8_t num1,num2;
       printf("please input one num1 num2\n");
       scanf("%d\n", &num1);
       scanf("%d\n", &num2);
       CountBitDiff(num1, num2); 
   }
   
   

這樣只能判斷兩個整數的比特位， 如果繼續輸入作爲後面的比特位，只需要對上述程序稍作修改，

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <map>
using namespace std;
map<int, int> Mymap;

int g_flag = 0;

//顯示兩個整數int哪一個比特值不同
void  CountBitDiff(int n, int m) {
    int a[8] = {0};
    int b[8] = {0};
    for(int i = 0; i < 8; i++) { 
        a[i] = (n>>i)&1;
    }
    for(int i = 0; i < 8; i++) { 
       b[i] = (m>>i)&1;
    }
    for(int i = 0; i < 8; i++) {
        if(a[i] ^ b[i]) {
            // printf("int8數據第幾位不同：%d\t", i + g_flag * 8);
            // printf("數據那一位變成：%d\n",b[i]);    
            Mymap.insert( pair<int, int> (i + g_flag * 8, b[i]));
        }
        
    }
     g_flag++; 
    printf("\n");
}

int main()
{
    int8_t num1,num2;
    printf("please input num1 num2\n");
    while(1) {
        scanf("%d\n", &num1);
        scanf("%d", &num2);
        CountBitDiff(num1, num2); 
        map<int, int>::iterator it;
        for (it = Mymap.begin(); it != Mymap.end(); it++){
             printf("%d---->%d\n", it->first, it->second);
        }
    }
}