Cod sursa(job #2359709)
| Utilizator | Data | 1 martie 2019 08:10:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
int gcd(int left, int right) {
return (!right) ? left : gcd(right, left % right);
}
int main() {
std::ifstream input("euclid2.in");
std::ofstream output("euclid2.out");
int n;
input >> n;
for (int index = 0; index < n; index++) {
int left, right;
input >> left >> right;
output << gcd(left, right) << '\n';
}
output.close();
input.close();
return 0;
}
