Cod sursa(job #1713557)
Utilizator | Data | 5 iunie 2016 21:49:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 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, a, b;
for (in >> T; T; --T) {
in >> a >> b;
out << gcd(a, b) << "\n";
}
in.close();
out.close();
return 0;
}