[Py] Euclid algorithm (MDC)

# maior divisor comum (mdc)
# 60 - 50 = 10
# 50 - 10 = 40
# 40 - 10 = 30
# 30 - 10 = 20
# 20 - 10 = 10
# 10 - 10 = 0
def euclid(a, b):
    return b and euclid(b, a % b) or a

# The largest common divisor between the numbers 50 and 60 is 10.
x = euclid(60,50)
print(x)