Cod sursa(job #1744626)
Utilizator | Data | 20 august 2016 01:08:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
int gcd(int a, int b) {
return b ? gcd (b, a % b) : a;
}
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;
}