Cod sursa(job #3138961)
Utilizator | Data | 23 iunie 2023 16:28:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
inline constexpr int gcd(int a, int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main() {
std::ifstream in{"euclid2.in"};
std::ofstream out{"euclid2.out"};
int a, b;
in.ignore();
while(in >> a >> b) {
out << gcd(a, b) << '\n';
}
return 0;
}