题解 | #求最小公倍数#

def func(m, n):
    if n % m == 0:
        return m
    else:
        if n > m:
            on = m
            m = n % m
            n = on

        else:
            on = n
            n = m % n
            m = on

        return func(m, n)


lst = list(map(int, input().split()))
lst.sort()
A, B = lst
print(int((A * B) / func(A, B)))

辗转相除求最大公约数，再拿两数之积/最大公约=最小公倍数