Cod sursa(job #1174520)
Utilizator | Data | 23 aprilie 2014 09:14:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
int main()
{
FILE*f=fopen("euclid2.in","r");
FILE*g=fopen("euclid2.out","w");
int n,a,b,r;
fscanf(f,"%d",&n);
while(n--)
{
fscanf(f,"%d%d",&a,&b);
while(a!=b)
if(a>b)
{
r=a/b;
if(b*r==a)
r--;
a=a-b*r;
}
else
{
r=b/a;
if(a*r==b)
r--;
b=b-a*r;
}
fprintf(g,"%d\n",a);
}
fclose(f);
fclose(g);
return 0;
}