Cod sursa(job #289920)
Utilizator | Iordache Albert Abi79 | Data | 27 martie 2009 10:28:59 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
FILE *in=fopen("euclid2.in","r"),*out=fopen("euclid.out","w");
long int n,a,b;
long int gcd(long int x, long int y)
{
if(x%y==0) return y;
return gcd(y,x%y);
}
int main()
{
fscanf(in,"%ld",&n);
for(int i=1;i<=n;i++)
{
fscanf(in,"%ld %ld",&a,&b);
fprintf(out,"%ld\n",gcd(a,b)); //greatest common divisor
}
fcloseall();
return 0;
}