Solved-finding the GCD

# Algo in python of euclidean algo
a = int(input("Type an exact number"))
b = int(input("Type another exact number"))

while b != 0:
    # we do a = bq+r then:
    # we want to restart with a set to b and b set to r
    c = b
    b = a % b
    a = c
print(a)