Cod sursa(job #2255435)
Utilizator | Data | 6 octombrie 2018 22:50:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if(!b) return a;
return gcd(b, a%b);
}
int main() {
FILE *fin, *fout;
fin = fopen("euclid2.in", "r");
fout = fopen("euclid2.out", "w");
int n, a, b;
fscanf(fin, "%d", &n);
for(int i=1; i<=n; i++) {
fscanf(fin, "%d%d", &a, &b);
fprintf(fout, "%d\n", gcd(a, b));
}
return 0;
}