Cod sursa(job #190100)
Utilizator | Data | 19 mai 2008 23:24:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
long gcd(long a,long b)
{
if (!b)
return a;
return gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","rt",stdin);
freopen("euclid2.out","wt",stdout);
long a,b,t,i;
scanf("%ld\n",&t);
for (i=0;i<t;i++)
{
scanf("%ld %ld\n",&a,&b);
printf("%ld\n",gcd(a,b));
}
return 0;
}