Cod sursa(job #560954)
Utilizator | Data | 18 martie 2011 19:27:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
int T,M,N;
int eu(int a, int b)
{
if (!b) return a;
return eu(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for (; T; --T)
{
scanf("%d %d", &M, &N);
printf("%d\n", eu(M, N));
}
return 0;
}