Cod sursa(job #593431)
| Utilizator | Data | 2 iunie 2011 18:46:39 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
long euclid(long a, long b)
{
long tmp;
while(b>0)
{
tmp=b;
b=a%b;
a=tmp;
}
return a;
}
int main()
{
FILE *f,*g;
f=fopen("euclid2.in","r");
g=fopen("euclid2.out","w");
int t;
fscanf(f,"%d",&t);
long a,b;
for(int i=0;i<t;i++)
{
fscanf(f,"%ld %ld",&a,&b);
fprintf(g,"%ld \n",euclid(a,b));
}
fclose(f);
fclose(g);
return 0;
}