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.

Vincoli

0 ≤ a, b ≤ 10¹⁸

Esempi

Input:
a = 48
b = 18

Output atteso:
expected = 6

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

Output atteso:
long long expected = 6;

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

Output atteso:
long expected = 6;

Input:
a = 17
b = 5

Output atteso:
expected = 1

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

Output atteso:
long long expected = 1;

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

Output atteso:
long expected = 1;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• UW TCSS 142 Introduction to Programming - master syllabus