[파이썬/python] 백준 1934번 : 최소공배수 (🥉1) (유클리드호제법)

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

import sys
n=int(input())
for i in range(n):
    a,b=map(int,sys.stdin.readline().split())
    aa,bb=a,b
    while a%b!=0: 
        a,b=b,a%b  
    print(aa*bb//b)

a=6, b=10

aa=a,bb=b => aa=6, bb=10

 

6%10 = 6

a=10, b=6

10%6 = 4

a=6, b=4

6%4 = 2

a=4, b=2

4%2=0

 

aa*bb//b => 30