题解 | #求最小公倍数#
求最小公倍数
https://www.nowcoder.com/practice/22948c2cad484e0291350abad86136c3
data = list(map(int, input().split()))
def gcd(n1, n2):
#"""最大公约数函数"""
return gcd(n2, n1 % n2) if n2 > 0 else n1
def lcm(n1, n2):
# """最小公倍数函数"""
return n1 * n2 // gcd(n1, n2)
print(lcm(data[0], data[1]))
