baekjoon - python - 1934

https://www.acmicpc.net/problem/1934

1934번: 최소공배수

# @Author YoungMinKim
# baekjoon
def gcd(a,b):
    if a<b:
        a,b=b,a
    while b!=0:
        a,b= b,a%b
    return a
def lcm(a,b):
    return a*b // gcd(a,b)
N=int(input())
for i in range(N):
    a,b = map(int,input().split())
    print(lcm(a,b))