백준 1934 - 최소공배수 (파이썬)

Answer

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

n = int(input())

for _ in range(n):
    a, b = map(int, input().split())

    print(a * b // gcd(min(a, b), max(a, b)))