def divisor(num): divisor_lst = [a for a in range(1, num+1 ) if num % a == 0] return divisor_lst
def solution(n, m): a = min(n,m) b = max(n,m) while b != 0: a, b = b, a % b b = int(m*n/a) return [a,b] # 최대공약수 a, 최소공배수 b