Greatest Common Divisor

Write a function int gcd(int a, int b) that returns the greatest common divisor of a and b using the Euclidean algorithm (repeatedly replace the pair with b and a % b until b is 0).

For gcd(12, 18) the program prints 6.

Expected Output:

6↵

= newline. The output ends with a newline — print one after the last line.

Hints4 available

Topics:

Functions

Code Editor

Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (cout, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.