公约数计算

// Greatest common denominator, by Euclid
int gcd(int a, int b) {
    if (a < b) return gcd(b,a);
    if (b == 0) return a;
    return gcd(b, a % b);
}