Cod sursa(job #898346)
| Utilizator | Data | 28 februarie 2013 10:02:15 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *in,*out;
long int cmmdc(long int a,long int);
long int x,y,n,divizor;
int i;
int main()
{
in=fopen("euclid2.in","rt");
out=fopen("euclid2.out","wt");
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%ld%ld",&x,&y);
divizor=cmmdc(x,y);
fprintf(out,"%ld\n",divizor);
}
fclose(in);
fclose(out);
return 0;
}
long int cmmdc(long int a,long int b)
{
long int r=a%b;
while(r==1)
{
a=b;
b=r;
r=a%b;
}
return b;
}
