def gcd(a: int, b: int) -> int:
    """ Return the GCD of a and b using Euclid's algorithm.

    :param a: First integer.
    :param b: Second integer.
    :return: The Greatest Common Divisor between two given numbers.
    """
    while a != 0:
        a, b = b % a, a
    return b