Cod sursa(job #167074)
Utilizator | Fodor Gabor fogab | Data | 28 martie 2008 22:14:16 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream.h>
#include <stdio.h>
int n, a, b;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
for (; n; --n)
{
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
fclose(stdin);
fclose(stdout);
return 0;
}