Cod sursa(job #1802886)
| Utilizator |  demon demon BigDyma |
Data | 10 noiembrie 2016 19:00:00 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
int g_n, g_a, g_b;
int gcd(int a, int b)
{
int c;
while (a)
c = a; a = b % a; b = c;
return (b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &g_n);
while (g_n)
{
scanf("%d %d", &g_a, &g_b);
printf("%d\n", gcd(g_a, g_b));
g_n--;
}
return (0);
}