CJCoding With Joseph

Function: Greatest Common Divisor

Complete the function gcd so it returns the greatest common divisor of two positive integers. The main function reads two integers and prints their GCD.

Example: input '12 18' prints 6.

Expected Output:

6
Topics:
Functions/Methods
๐Ÿ“ฅ Auto-Input:
12 18\n
This input is automatically fed to your program's stdin
Code Editor
1
Tab to indent ยท Ctrl+Enter to run ยท Ctrl+Space to expand shortcuts (p, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.