(CodeUp) 코드업 1935 - Python - (재귀함수) LCA

def deep(a, b):
    if a==b:
        return a
    elif a>b:
        return deep(int(a/2),int(b))
    elif a<b:
        return deep(int(a),int(b/2))
        
a, b = input().split(' ')
a = int(a)
b = int(b)
result = deep(a, b)
print(result)