代码如下:
def a(m, n):
if m > n:
r = n
else:
r = m
for i in range(1, r+1):
if (m % i == 0) and (n % i == 0):
gys = i
return gys
gys = a(12, 6)
print(gys)
效果如下:
代码如下:
def a(m, n):
if m > n:
r = n
else:
r = m
for i in range(1, r+1):
if (m % i == 0) and (n % i == 0):
gys = i
return gys
gys = a(12, 6)
print(gys)
效果如下: