Cod sursa(job #807843)
| Utilizator |  Dinu Radu RaduGabriel2012 |
Data | 5 noiembrie 2012 20:02:32 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
FILE *f=fopen("euclid2.in","r"),*g=fopen("euclid2.out","w");
int t,i,a,b;
int cmmdc(int x,int y)
{if ((!x)||(!y)) return x+y;
if (x>y) return cmmdc(y,x%y); return cmmdc(x,y%x);
}
int main()
{
fscanf(f,"%d",&t);
for (i=1;i<=t;i++)
{
fscanf(f,"%d %d",&a,&b);
fprintf(g,"%d\n",cmmdc(a,b));
}
return 0;
}
