1 // Taken from /guias/1/ej27.cpp 2 // https://en.wikipedia.org/wiki/Greatest_common_divisor 3 4 #include <iostream> 5 6 int find_gcd(int a, int b) { 7 if(!b) 8 return a; 9 10 return find_gcd(b, a % b); 11 } 12 13 14 int main (void) { 15 std::cout << find_gcd(8, 12) << std::endl; 16 17 return 0; 18 }
