알고리즘

[백준] 1934 최소공배수

유노비 2023. 10. 17. 22:21
반응형
n = int(input())
result = []
for i in range(n):
    a,b = map(int, input().split())
    max_num, min_num = max(a,b) , min(a,b)
    diff = max_num % min_num

    while diff != 0 :
        max_num = min_num
        min_num = diff
        diff = max_num % min_num

    result.append(int((a*b)/min_num))

print(*result, sep='\n')
반응형