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 input 12 then 18 the output is:

6

Expected Output:

Topics:

Loops

Code Editor

Tab to indent · Ctrl+Enter to run · 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.