Greatest Common Divisor

Return the greatest common divisor of a and b. Euclid's algorithm repeatedly replaces (a, b) with (b, a mod b) until b is 0.

Implement gcd(a, b).

Input

a: The first number. b: The second number.

Output

Return gcd(a, b). gcd(0, 0) is 0.

Restricciones

0 ≤ a, b ≤ 10¹⁸

Ejemplos

Entrada:
a = 48
b = 18

Salida esperada:
expected = 6

Entrada:
long long a = 48;
long long b = 18;

Salida esperada:
long long expected = 6;

Entrada:
long a = 48;
long b = 18;

Salida esperada:
long expected = 6;

Entrada:
a = 17
b = 5

Salida esperada:
expected = 1

Entrada:
long long a = 17;
long long b = 5;

Salida esperada:
long long expected = 1;

Entrada:
long a = 17;
long b = 5;

Salida esperada:
long expected = 1;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• UW TCSS 142 Introduction to Programming - master syllabus