Cod sursa(job #281858)
Utilizator | Data | 16 martie 2009 08:13:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
FILE *f=fopen("euclid2.in","r");
FILE *g=fopen("euclid2.out","w");
long a,b,n;
int i;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++){ fscanf(f,"%d %d",&a,&b);
while(a!=b) if(a>b) a=a-b;
else b=b-a;
fprintf(g,"%d\n",a);
}
fclose(f);
fclose(g);
return 0;
}