💡 Python 3
최대공약수와 최소공배수 [Link]
def solution(n, m):
if n > m: n, m = m, n
a, b = m, n
while True:
mod = a % b
if mod == 0 : break
a, b = b, mod
return [b, m*n/b]
def gcdlcm(a, b):
c, d = max(a, b), min(a, b)
t = 1
while t > 0:
t = c % d
c, d = d, t
answer = [c, int(a*b/c)]
return answer