Cod sursa(job #1560761)
Utilizator | Data | 3 ianuarie 2016 11:33:00 | |
---|---|---|---|
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() {
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";
}
return 0;
}