Cod sursa(job #266150)
Utilizator | Data | 24 februarie 2009 22:31:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
FILE *f=fopen("euclid2.in","r"), *g=fopen("euclid2.out","w");
int n,i,a,b;
inline int cmmdc(int a, int b)
{
if(b==0) return a;
int d;
d=cmmdc(b,a%b);
return d;
}
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d %d",&a,&b);
if(a>b) a^=b^=a^=b;
fprintf(g,"%d\n",cmmdc(a,b));
}
fclose(f);
fclose(g);
return 0;
}