所以我们可以先求出a和b的最大公约数,然后用两个数的乘积除以最大公约数就等于最小公倍数。(答案来自来自大佬,非本人)
def gcd(a, b):
"""Return greatest common divisor using Euclid's Algorithm."""
while b:
# % 取余
a, b = b, a % b
return a
def lcm(a, b):
"""Return lowest common multiple."""
return int(a * b / gcd(a, b))
a,b = map(int, input().split())
print(lcm(a,b))