[백준] 1934번_최소공배수

문제 링크 : https://www.acmicpc.net/problem/1934

1934번: 최소공배수

def GCD(a,b):
    while b!=0:
        r = a%b
        a = b
        b = r
    return a

def LCM(a,b):
    return a*b//GCD(a,b)

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