# 计算两个数的最大公约数 def gcd_euclidean(a, b): while b: a, b = b, a % b return a def gcd_recursive(a, b): if b == 0: return a return gcd_recursive(b, a % b) def lcm(a, b):
# 计算两个数的最大公约数 def gcd_euclidean(a, b): while b: a, b = b, a % b return a def gcd_recursive(a, b): if b == 0: return a return gcd_recursive(b, a % b) def lcm(a, b):