long long pow_mod(long long x,long long a,long long n)//a^b mod mod
{
if(a==0) return 1;
long long ans = pow_mod(x,a/2,n);
long long temp = (ans*ans)%n;
if(a%2) temp = (temp*x)%n;
return temp;
}
long long pow_mod(long long a,long long b,long long n) //a^b mod n
{
long long ret=1;
for (; b; b>>=1,a=(long long)(((long long)a)*a%n))
if (b&1)
ret=(long long)(((long long)ret)*a%n);
//printf("%d\n",ret);
return ret;
}
HDU2817使用
求 a^b mod mod 的模板
最新推荐文章于 2022-06-14 21:53:18 发布