Function gcd

Lib/test/test_binop.py:7–11

Greatest common divisor using Euclid's algorithm.

(a, b)

from abc import ABCMeta

def gcd(a, b):
    """Greatest common divisor using Euclid's algorithm."""
    while a:
        a, b = b%a, a
    return b

def isint(x):
    """Test whether an object is an instance of int."""