编程实现计算同余式ax≡b(mod m)的解

def gcd(a,b):
    if a>b:
        a,b=b,a
    if b%a==0:
        return a
    else:
        return gcd(a,b%a)

a=int(input("a="))
b=int(input("b="))
m=int(input("m="))
i=2
j=1

x1=gcd(a,m)
x2=a/x1
if(b%x1==0):
    while(x2%(m/x1)!=1):
        x2=a/x1*i
        i=i+1
    x2=i-1
    print("x'=%d(mod %d)"%(x2,m/x1))
    x3=(b/x1*x2)%(m/x1)
    print("x0=%d(mod %d)"%(x3,m/x1))
    print("原同余式所有解为x = %d"%(x3), end="")
    while(j<x1):
        print(",", end=" ")
        x4=x3+j*(m/x1)
        j=j+1
        print("%d"%(x4), end="")
else:
    print("该同余式无解")