位运算总结:待续
//a的b次方
int poww(int a, int b) {
int ans = 1;
while (b != 0) {
if (b & 1 != 0)
ans *= a;
a *= a;
b >>= 1;
}
return ans;
}
https://www.cnblogs.com/Bylight/p/10538891.html
快速幂求余模板
int quickPow(int a,int b,int m){
int sum=1;
while(b){
if(b&1) sum=sum*a%m;
b>>=1;
a=a*a%m;
}
return sum%m;
}