Cod sursa(job #633802)
Utilizator | Data | 14 noiembrie 2011 21:21:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
// Algoritmul lui Euclid
#include <stdio.h>
int euclid(long a, long b)
{
if(!b)
return a;
else
euclid(b,b%a);
}
int main()
{
int n,i;
long a,b;
FILE* f=fopen("euclid2.in","rt");
FILE* g=fopen("euclid2.out","wt");
fscanf(f,"%d", &n);
for (i=1;i<=n;i++)
{
fscanf(f,"%d%d",&a,&b);
fprintf(g,"%d\n",euclid(a,b));
}
fclose(f);
fclose(g);
return 0;
}