快速幂:
long long fastpower(long long base,long long power)
{
long long result=1;
while(power>0)
{
if(power&1)
result=result*base%MOD;
power>>=1;
base=(base*base)%MOD;
}
return result%MOD;
}
64位整数乘法:
long long f(long long a, long long b)
{
long long ret = 0;
while(b)
{
if(b&1) ret = (ret + a)%MOD;
a = a*2%MOD;
b >>= 1;
}
return ret%MOD;
}