Cod sursa(job #1475412)
Utilizator | Data | 24 august 2015 04:28:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <cstdio>
inline int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int tests, a, b;
scanf("%d", &tests);
for (int test = 1; test <= tests; test++) {
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}