Cod sursa(job #1439142)
| Utilizator | Data | 21 mai 2015 16:27:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
//001
#include <cstdio>
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
FILE* fi = fopen("euclid2.in", "rt");
FILE* fo = fopen("euclid2.out", "wt");
long totaltest;
fscanf(fi, "%ld", &totaltest);
for (long test = 1; test <= totaltest; test++) {
long a, b;
fscanf(fi, "%ld%ld", &a, &b);
fprintf(fo, "%ld\n", gcd(a, b));
}
return 0;
}
