Cod sursa(job #2125716)
Utilizator | Data | 8 februarie 2018 17:55:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int gcd(int a, int b) {
int t;
while (b) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main(void) {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int T, a, b;
scanf("%d", &T);
for (; T; T--) {
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
/*f >> a >> b;
o << gcd(a, b) << std::endl;*/
}
return 0;
}