方法1:
def gcd(x, y):
while n:
x, y = y, x % y
return x
方法2:
def yue(x,y):
if y:
return gcd(y,x%y)
else:
return x
方法1:
def gcd(x, y):
while n:
x, y = y, x % y
return x
方法2:
def yue(x,y):
if y:
return gcd(y,x%y)
else:
return x
转载于:https://www.cnblogs.com/nimrod-bit/p/3705249.html