Cod sursa(job #156203)
Utilizator | Data | 12 martie 2008 13:35:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
int i, T;
long n1, n2;
long gcd(long a, long b)
{
if(b == 0) return a;
else return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(i = 1; i <= T; i++)
{
scanf("%ld%ld", &n1, &n2);
printf("%ld\n", gcd(n1, n2));
}
return 0;
}