Answer to Question #257431 in Python for Andy

Question

The greatest common divisor, also known as GCD, is the greatest number that will, without a remainder, fully divide a pair of integers.

Now, I want you to make a program that will accept two integers and with the use of loops, print out their GCD. Make good use of conditional statements as well.

Off you go!

Input

A line containing two integers separated by a space.

6·9

Output

A line containing an integer.

3

Answer 1

n1, n2 = input().split()
n1, n2 = int(n1), int(n2)
for i in range(n1, 0, -1):
    if n1%i == 0 and n2%i == 0:
        print(i)
        break