Greatest Common Divisor

gcd.cpp

#include <iostream>

int gcd(int a, int b) {
    int current_gcd = 1;
    for (int d = 2; d <= a && d <= b; d++) {
        if (a % d == 0 && b % d == 0) {
            if (d > current_gcd) {
                current_gcd = d;
            }
        }
    }
    return current_gcd;
}

int euclidGCD (int a, int b) {
    if (b == 0) return a;
    return euclidGCD(b, a%b);
}

int main() {
    int a, b;
    std::cin >> a >> b;
//    std::cout << gcd(a, b) << std::endl;
    std::cout << euclidGCD(a, b) << std::endl;
    return 0;
}