模指数运算:
//模指数运算
int Mod_Exp(int a, int b, int c)
{
if(b==0) return 1;
int z=1;
while(b>0){
if((b & 1) == 1)
z = (z*a) % c;
b=b/2;
a=(a*a)%c;
}
return z;
}
乘法逆元:
//乘法逆元
def egcd(a, m):
x0, y0, x1, y1 = 1, 0, 0, 1
while m != 0:
q, a, m = a //\
m, m, a % m
x0, x1 = x1, x0 - x1 * q
y0, y1 = y1, y0 - y1 * q
return a, x0, y0
gcd, niyuan, t = egcd(71, 131)
print("乘法逆元为:", niyuan)