Lv.1_최대공약수와 최소공배수

https://school.programmers.co.kr/learn/courses/30/lessons/12940

프로그래머스

def solution(n, m):
    answer = []
    
    for i in range(min(n,m), 0, -1):
        if n % i == 0 and m % i == 0:
            answer.append(i)
            break
    
    for i in range(max(n,m), (n*m)+1, 1):
        if i % n == 0 and i % m == 0:
            answer.append(i)
            break
            
    return answer

break를 빼먹지 말자