[알고리즘]기초1-최대공약수와 최소공배수

최대공약수와 최소공배수

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

def solution(n, m):
    answer=[]
    greatest=0
    least=0
    
    for i in range(1,min(n,m)+1):
        if (n%i==0) and (m%i==0):
            greatest=i
            
    least=n*m/greatest
    answer = [greatest,least]
    return answer

import math 

def solution(n, m):
    answer=[]
    greatest=0
    least=0
    greatest=math.gcd(n,m)
    least=n*m/greatest
    answer = [greatest,least]
    return answer