<span style="font-size:18px;">//计算a^bmodn
int modexp_recursion(int a,int b,int n)
{
int t = 1;
if (b == 0)
return 1;
if (b == 1)
return a%n;
t = modexp_recursion(a, b>>1, n);
t = t*t % n;
if (b&0x1)
{
t = t*a % n;
}
return t;
}
</span>
快速幂取模算法
最新推荐文章于 2024-10-04 20:45:38 发布