Cod sursa(job #614945)
Utilizator | Burcea Silviu DFA1 | Data | 8 octombrie 2011 09:51:30 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
long cmmdc ( long a, long b)
{
if (a==b) { if (a==1) return 0; else return a; }
else if (a>b) return cmmdc(b,a-b);
else return cmmdc(a,b-a);
}
int main()
{
long a,b;
FILE *f;
FILE *g;
int t;
f = fopen("euclid2.in","r");
g = fopen("euclid2.out","w");
fscanf(f,"%d",&t);
for (int i=1;i<=t;i++){
fscanf(f,"%ld %ld",&a,&b);
fprintf(g,"%ld\n",cmmdc(a,b));
}
fclose(g);
fclose(f);
return 0;
}