欧几里得算法求最大公约数:
def gcd(m, n):
if m < n:
m, n = n, m
while m % n != 0:
r = m % n
m, n = n, r
return n
最小公倍数:
def lcm(m, n):
max_val = max(m, n)
while True:
if max_val % m == 0 and max_val % n == 0:
lcm = max_val
break
else:
max_val += 1
return lcm
print(lcm(2,9))