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