题解 | 二进制不同位数

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e7+10;
ll a[N],b[N];
int main()
{
    ll n,m;
    cin>>n>>m;
    ll num_n=0,num_m;
    //正序存储
    while(n)
    {
        a[++num_n]=n%2;
        n/=2;
    }
    while(m)
    {
        b[++num_m]=m%2;
        m/=2;
    }
//逆序
   ll ans=0;
   int len=max(num_n,num_m);
   for(int i=1;i<=len;i++)
   {
    if(a[i]!=b[i])
    {
           ans++;
    }
   }
    cout<<ans<<endl;
    return 0;
}