GCD with a Loop

Read two positive integers a and b from input. Use a loop (the Euclidean algorithm) to compute their greatest common divisor, and print it followed by a newline. For input 12 18 the exact output is what is shown in Expected Output.

Repeat a % b, moving b into a and the remainder into b, until b becomes 0.

Expected Output:

6↵

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

Hints4 available

Topics:

Loops

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.