*crypto*--安洵杯

def mypow(a, b, m):
res = 1
a %= m
while b != 0:
if ((b & 1) == 1):
res = (res * a) % m
a = (a * a) % m
b >>= 1
return res

def exgcd(a,b):
if (b==0):
xy[0]=1
xy[1]=0
else:
exgcd(b,a%b)
x=xy[0]
xy[0]=xy[1]
xy[1]=x-int((a/b))*xy[1]
p = 1231
y = 1147
xy=[0,0]
x=1217
exgcd(x,(p-1))
x = xy[0]
s = x % (p - 1)
print(s)
原文地址:https://www.cnblogs.com/kubopiy/p/13621427.html