Cod sursa(job #929237)
Utilizator | Data | 26 martie 2013 22:09:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.32 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) {
FILE *f, *e;
f = fopen("euclid2.in", stdin);
e = fopen("euclid2.out", stdout);
scanf("%d", &T);
for(;T;--T) {
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A,B));
}
return 0;
}