Cod sursa(job #1768421)
Utilizator | Data | 30 septembrie 2016 20:52:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
int gcd(int x, int y) {
return y ? gcd(y, x % y) : x;
}
int main() {
std::ifstream in {"euclid2.in"};
std::ofstream out {"euclid2.out"};
int T, x, y;
for (in >> T; T; --T ) {
in >> x >> y;
out << gcd(x, y) << '\n';
}
return 0;
}