int quickpow(int m,int n,int k)
{
int b =1;
while (n >0)
{
if (n &1)
b = (b*m)%k;
n = n >>1 ;
m = (m*m)%k;
}
return b;
}
快速幂取模
最新推荐文章于 2021-02-13 07:02:28 发布
int quickpow(int m,int n,int k)
{
int b =1;
while (n >0)
{
if (n &1)
b = (b*m)%k;
n = n >>1 ;
m = (m*m)%k;
}
return b;
}