Cod sursa(job #1802895)
Utilizator | demon demon BigDyma | Data | 10 noiembrie 2016 19:06:40 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
int T,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", &T);
while (--T)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return (0);
}