유클리드 호제법

방법1

def gcd(num1,num2):
    if(num1>num2):
        if(num1%num2==0):
            return num2
        else:
            return gcd(num2,num1%num2)
    else:
        if(num2%num1==0):
            return num1
        else:
            return gcd(num1,num2%num1)
        
if __name__ == "__main__":
    num1,num2=map(int,input().split())
    print(gcd(num1,num2))