[Programmers] - 최대공약수와 최소공배수 (Level 1)

---

연습문제
LEVEL : 1
문제링크

n = 1
m = 10

def solution(n, m):

    max_num = 0
    min_num = 0

    for i in range(1,n+1):
        if n % i == 0 and m % i == 0:
            max_num = i

    list_for_min = [max(n,m)*j for j in range(1,min(n,m)+1)]
    for i in range(1, max(n,m)+1):
        if min(n,m)*i in list_for_min:
            min_num = min(n,m)*i
            break

    return [max_num, min_num]

solution(n, m)

[1, 10]







'Odd'