tests/sysy_lvX/087_gcd.sy


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19


int gcd(int m, int n)
{
    if (n == 0) {
        return m;
    }
    return gcd(n, m % n);
}

int main()
{
    int k = getint();
    while (k > 0) {
        int a = getint(), b = getint();
        putint(gcd(a, b)); putch(10);
        k = k - 1;
    }
    return 0;
}