Write a function int gcd(int a, int b) that returns the greatest common divisor of a and b using the Euclidean algorithm (repeatedly replace the pair with b and a % b until b is 0).

For gcd(12, 18) the program prints 6.