Cod sursa(job #1490014)
Utilizator | Data | 22 septembrie 2015 17:10:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
int gcd(int x, int y) {return 0 == y ? x : gcd(y, x % y);}
int main() {
int T, x, y;
std::ifstream in{"euclid2.in"};
std::ofstream out{"euclid2.out"};
in >> T;
while (T--) {
in >> x >> y;
out << gcd(x, y) << '\n';
}
return 0;
}