Cod sursa(job #807419)
Utilizator | Data | 4 noiembrie 2012 18:22:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
long gcd(long a,long b)
{
if (!b) return a;
else return gcd(b,a%b);
}
int main()
{
FILE*f;
FILE*g;
long a,b,t;
f = fopen("euclid2.in","r");
g = fopen("euclid2.out","w");
fscanf(f,"%li",&t);
for (long i=0;i!=t;i++)
{
fscanf(f,"%li %li",&a,&b);
fprintf(g,"%li",gcd(a,b));
}
return 0;
}