Cod sursa(job #693521)
Utilizator | Data | 27 februarie 2012 13:14:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#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, &a);
printf("%d\n", gcd(a, a));
}
return 0;
}