Cod sursa(job #1237994)
Utilizator | Data | 5 octombrie 2014 13:46:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <cstdlib>
inline int gcd(int x, int y) {return 0 == y ? x : gcd(y, x % y);}
int main() {
int T, a, b;
std::ifstream in {"euclid2.in"};
std::ofstream out {"euclid2.out"};
for (in >> T; T; --T) {
in >> a >> b;
out << gcd(a, b) << '\n';
}
return EXIT_SUCCESS;
}