Correlation of XOR / and

Niuke winter vacation training camp H- Xiaosha's number
From the nature of XOR , Because the sum of the elements is m, The first m Convert to binary ,
To maximize the exclusive or of each element , It is necessary to ensure that all elements cannot be duplicated in the same bit under the binary system 1 So when m One of them 1, Only on the n A digit in a number .
Just statistics m How many are there in binary 1, every last 1 Can be placed in n In a position . The final result is $n^x$

#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1e9 + 7;
typedef long long LL;
LL n, m;

int main() 
{
    
    scanf("%lld%lld", &n, &m);

    LL res=1;
    n%=mod;    // This must be added with ,res*n Explosive longlong
    while(m)
    {
    
        if(m&1) res=res*n%mod;
        m>>=1;
    }
    printf("%lld",res);
  return 0;
}