int qmi(int n, int k, int p)
{
int res = 1 % p;
while (k) {
if (k & 1) res = 1ll * res * n % p;
n = 1ll * n * n % p;
k >>= 1;
}
return res;
}
打赏



int qmi(int n, int k, int p)
{
int res = 1 % p;
while (k) {
if (k & 1) res = 1ll * res * n % p;
n = 1ll * n * n % p;
k >>= 1;
}
return res;
}


0 条评论