Cod sursa(job #1674118)
Utilizator | Data | 4 aprilie 2016 13:37:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
static int gcd(int a, int b)
{
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void)
{
int t, i, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%i", &t);
for (i = 0; i < t; ++i) {
scanf("%i%i", &a, &b);
printf("%i\n", gcd(a, b));
}
return 0;
}