Cod sursa(job #2606782)
Utilizator | Data | 28 aprilie 2020 16:51:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
int gcd(int a, int b) {
if(!b)
return a;
return gcd(b, a % b);
}
int main() {
int t, T, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(t = 1; t <= T; ++t) {
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
}