GCD (Greatest Common Divisor) Problem Statement

You are given two numbers, X and Y. Your task is to determine the greatest common divisor of these two numbers.

The Greatest Common Divisor (GCD) of two integers is the largest positive integer that divides both numbers without leaving a remainder.

Example:

Input:

X = 20, Y = 15

Output:

5

Explanation:

The divisor 5 evenly divides both 20 and 15, and it is the largest number that can do so, hence the GCD is 5.

Constraints:

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