Cod sursa(job #401996)
Utilizator | Andrei C. Smaug- | Data | 23 februarie 2010 12:01:03 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int gcd(int a, int b){
if(!b) return a;
return gcd(b, a % b);
}
int main(){
FILE *finput, *foutput;
finput = fopen("euclid2.in", "r");
foutput = fopen("euclid2.out", "w");
int T;
long long int a, b;
for(fscanf(finput, "%d", &T); T > 0; T--){
fscanf(finput, "%lld %lld", &a, &b);
fprintf(foutput, "%d", gcd(a, b));
}
return 0;
}