Answer to Question #257484 in Python for Aron

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

num1, num2 = input().split()
num1, num2 = int(num1), int(num2)
if num1 >= num2:
	n = num2
else:
	n = num1
while n > 0:
	if num1 % n == 0 and num2 % n == 0:
		print(n)
		break
	else:
		n -= 1