p2.最大公因数
""" E1.Divide m by n and let r be the remainder. E2.if r=0 ,the algorithm terminates;n is the answer E3.set m<-n,n<-r, and go to back step E1 """ def disvisor(m,n): if m < n:  ...
an+bm=d
from maxdisvisor import *def findconst(m,n,a1=1,b=1,a=0,b1=0): """ if d is the max disvisor,then exits a and b that make 'am+bn=d' ,fi...