Cod sursa(job #273500)
| Utilizator |  barda liviu alexandru bardaliviu |
Data | 8 martie 2009 17:55:35 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream.h>
#include<stdio.h>
int main ()
{unsigned long t, a, b;
int i;
FILE *f,*g;
f=fopen("euclid2.in","r");
g=fopen("euclid2.out","w");
fscanf(f,"%l",&t);
for(i=1;i<=t;i++)
{fscanf(f,"%l%l",&a,&b);
do
{if(a>b)
a=a-b;
else
b=b-a;}
while(a!=b);
fprintf(g,"\t");
fprintf(g,"%l",a);
}
fclose(f);
fclose(g);
return 0;
}