最大公约数

使用欧几里德德算法，Python语言描述：

def gcd(m,n):
    if m == 0 or n == 0:
        return 0
    elif m == n:
        return m

    a = max(m, n)
    b = min(m, n)
    r = 1
    while r > 0:
        r = a % b
        a = b
        b = r
    return a

if __name__ == '__main__':
    x = int(raw_input('Input value x : '))
    y = int(raw_input('Input value y : '))

    z = gcd(x, y)
    print z