Cod sursa(job #166709)
Utilizator | Data | 28 martie 2008 13:29:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
long t,a,b,i;
long dc(int a, int b)
{
if (!b) return a;
return dc(b, a % b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdin);
scanf("%ld",&t);
for(i=1;i<=t;i++)
{
scanf("%ld %ld\n",&a,&b);
printf("%ld",dc(a,b));
}
return 0;
}