def lianfenshu(e,n):
fenshu=[]
while n:
fenshu.append(e//n)
e, n = n, e % n
return fenshu
def jianjin(res):
fs=[]
for i in range(1,len(res)):
resi=res[0:i]
n,d=1,0
for j in resi[::-1]:
d,n=n,j*n+d
fs.append((d,n))
return fs
def wiener(e,n):
res=lianfenshu(e,n)
for (d,k) in jianjin(res):
if k==0:continue
if (e*d-1)%k!=0:continue
phin=(e*d-1)//k
b=n-phin+1
a=1
xx=gmpy2.isqrt(b*b-4*a*n)
p,q=(-b+xx)//(2*a),(-b-xx)//(2*a)
if p*q==n:
pp,qq=abs(int(p)),abs(int(q))
d=gmpy2.invert(e,(pp-1)*(qq-1))
return d
刚开始学习,欢迎指导。