Cod sursa(job #980789)
Utilizator | Daniel Amariei daniel.amariei | Data | 5 august 2013 17:02:36 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <stdio.h>
long cmmdc(long a, long b)
{
return (b == 0 ? a : cmmdc(b, a % b));
}
int main()
{
int T;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
while (T--)
{
long a, b;
scanf("%ld %ld", &a, &b);
printf("%ld\n", cmmdc(a, b));
}
return 0;
}