Cod sursa(job #950853)
Utilizator | Data | 18 mai 2013 14:56:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<cstdio>
using namespace std;
FILE *f=fopen("euclid2.in","r");
FILE *g=fopen("euclid2.out","w");
int n, a, b, i, d;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;++i)
{
fscanf(f,"%d %d",&a,&b);
while(a-b)
{
if(a>b)a-=b;
else b-=a;
}
fprintf(g,"%d\n",a);
}
fclose(f);
fclose(g);
return 0;
}