Cod sursa(job #875296)
Utilizator | Data | 9 februarie 2013 21:33:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
unsigned gcd(unsigned x, unsigned y)
{
if(y == 0) return x;
return gcd(y, x % y);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i)
{
unsigned x, y;
scanf("%u %u", &x, &y);
printf("%u\n", gcd(x, y));
}
return 0;
}