Cod sursa(job #180067)
Utilizator | Data | 16 aprilie 2008 16:46:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
long gcd(long a,long b){
if (!b) return a;
else return gcd(b, a % b) ;
}
int main(){
FILE *f,*g;
f=fopen("euclid2.in","r");
g=fopen("euclid2.out","w");
long i,t,x,y;
fscanf(f,"%d",&t);
for(i=0;i<t;i++){
fscanf(f,"%d %d",&x,&y);
fprintf(g,"%d\n",gcd(x,y));
}
fclose(f);
fclose(g);
return 0;
}