Cod sursa(job #153513)
Utilizator | Data | 10 martie 2008 16:30:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
#include <assert.h>
inline int gcd( int A, int B )
{
if (B == 0)
return A;
return gcd( B, A % B );
}
int main()
{
freopen("euclid2.in", "rt", stdin);
freopen("euclid2.out", "wt", stdout);
int T;
for (scanf("%d", &T); T; T--)
{
int A, B;
scanf("%d %d", &A, &B);
printf("%d\n", gcd( A, B ));
}
return 0;
}