Question

Submission 3: Greatest Common Divisor Euclid's algorithm is an ancient method for calculating the greatest common divisor (GCD) of two numbers. To calculate the GCD of two positive numbers $x$ and $y$, we use the formula $\gcd(x, y) = \begin{cases} x, & \text{if } y = 0\\ \gcd(y, x \mod y), & \text{otherwise.} \end{cases}$ Write a program that accepts two integers and computes their GCD. Input Input consists of two positive integers $x$ and $y$ separated by a single space. Output Output the GCD of $x$ and $y$. Example Input-Output Pairs Sample Input #1 6 27 Sample Output #1 3 Sample Input #2 100 3 Sample Output #2 1 Sample Input #3 10 10 Sample Output #3 10

          Submission 3: Greatest Common Divisor
Euclid's algorithm is an ancient method for calculating the greatest common divisor (GCD) of
two numbers. To calculate the GCD of two positive numbers \(x\) and \(y\), we use the formula
$\gcd(x, y) = \begin{cases} x, & \text{if } y = 0\\ \gcd(y, x \mod y), & \text{otherwise.} \end{cases}$
Write a program that accepts two integers and computes their GCD.
Input
Input consists of two positive integers \(x\) and \(y\) separated by a single space.
Output
Output the GCD of \(x\) and \(y\).
Example Input-Output Pairs
Sample Input #1
6 27
Sample Output #1
3
Sample Input #2
100 3
Sample Output #2
1
Sample Input #3
10 10
Sample Output #3
10

Submission 3: Greatest Common Divisor
Euclid's algorithm is an ancient method for calculating the greatest common divisor (GCD) of
two numbers. To calculate the GCD of two positive numbers x and y, we use the formula
(x, y) = x, if y = 0
(y, x y), otherwise.
Write a program that accepts two integers and computes their GCD.
Input
Input consists of two positive integers x and y separated by a single space.
Output
Output the GCD of x and y.
Example Input-Output Pairs
Sample Input #1
6 27
Sample Output #1
3
Sample Input #2
100 3
Sample Output #2
1
Sample Input #3
10 10
Sample Output #3
10

Added by Luis C.

Question

Please give Ace some feedback