CompilerSysY/testcases/functional_test/087_gcd.sy
2023-05-08 21:15:52 +08:00

20 lines
270 B
Plaintext

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;
}