[알고리즘] 최대공약수 구하기

최대공약수 구하기(GCD)

def gcd(a,b):
    min_num = a if a<b else b
    for x in range(0,min_num):
        divide = min_num-x
        if a%divide == 0 and b%divide == 0:
            return divide

def gcd_euclid(a,b):
    min_max = [a,b] if a<b else [b,a]
    if min_max[0] == 0:
        return min_max[1]
    return gcd_euclid(min_max[0],min_max[1]%min_max[0])

print(gcd_euclid(100,44))