Python3 代码

def gcd (m, n):

    if n > m:
        m, n = n, m

    if m % n == 0:
        return n

    return gcd (n, m % n)

def lcm(m, n):

    return  m * n // gcd(m, n)

m, n = map(int, input().split())
print(lcm(m, n))