Cod sursa(job #1736591)
Utilizator | Data | 2 august 2016 10:32:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
int n, a, b;
int euclid(a, b) {
if (!b) return a;
return euclid(b, a % b);
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
while(n--) {
scanf("%d%d", &a, &b);
printf("%d\n", euclid(a, b));
}
return 0;
}