最大公约数和最小公倍数

代码

1
2
3
4
5
6
7
8
9
10
11
def gcd(m, n):
    if m < n:
        return gcd(n, m)
    while n:
        m, n = n, m % n
    return m


if __name__ == '__main__':
    nums = [int(x) for x in input().split(' ')]
    print(gcd(nums[0], nums[1]), nums[0]*nums[1] // gcd(nums[0], nums[1]))