← Back to Loops
Question 439
Greatest Common Divisor with a Loop
Greatest Common Divisor with a Loop
Read two positive integers (one per line) and use a loop (the Euclidean algorithm) to compute their greatest common divisor, then print it. For input12then18the output is exactly what is shown in Expected Output.
Expected Output:
6= newline. The output ends with a newline — print one after the last line.
Hints4 available
Sign in to use hintsTopics:
Loops
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (cw, cr, fori)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.