Greatest Common Divisor Problem Statement

You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the given numbers.

Example:

Input:

X = 20, Y = 15

Output:

5

Explanation:

The greatest common divisor of 20 and 15 is 5, since 5 divides both 20 and 15 without a remainder

Input:

First line contains an integer 'T', the number of test cases.
Each test case consists of two space-separated integers 'X' and 'Y'.

Output:

For each test case, output the greatest common divisor of 'X' and 'Y', each on a new line.

Constraints:

1

Question

Greatest Common Divisor Problem Statement

You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the given numbers.

Example:

Input:

X = 20, Y = 15

Output:

Explanation:

The greatest common divisor of 20 and 15 is 5, since 5 divides both 20 and 15 without a remainder

Input:

First line contains an integer 'T', the number of test cases.
Each test case consists of two space-separated integers 'X' and 'Y'.

Output:

For each test case, output the greatest common divisor of 'X' and 'Y', each on a new line.

Constraints:

1 <= T <= 10
1 <= X, Y <= 10^9

Accepted Answer

# Recursive function to return gcd of a and b

def gcd(a, b):

# Everything divides 0

if (a == 0):

return b

if (b == 0):

return a

# base case

if (a == b):

return a

# a is greater

if (a > b):

return gcd(a-b, b)

return gcd(a, b-a)

# Driver program to test above function

a = 98

b = 56

if(gcd(a, b)):

print('GCD of', a, 'and', b, 'is', gcd(a, b))

else:

print('not found')