Cod sursa(job #3138964)
Utilizator | Data | 23 iunie 2023 16:35:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
constexpr int gcd(const int& a, const 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 N, a, b;
in >> N;
for(int i = 0; i < N; ++i) {
in >> a >> b;
out << gcd(a, b) << '\n';
}
return 0;
}