Return the greatest common divisor of two positive integers a and b (Euclid's algorithm).
Function
function solve(a, b)
Example 1
a = 12 b = 18 โ 6
Submit also runs 3 hidden tests, including edge cases.
Return the greatest common divisor of two positive integers a and b (Euclid's algorithm).
function solve(a, b)
a = 12 b = 18 โ 6
Submit also runs 3 hidden tests, including edge cases.