Cod sursa(job #153459)
Utilizator | Data | 10 martie 2008 15:53:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int T, A, B;
int gcd(int A, int B)
{
if (!B) return A;
if (A > B) return gcd(A-B, B);
return gcd(A, B-A);
}
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
for (scanf("%d", &T); T; --T)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return 0;
}