Pagini recente » Cod sursa (job #1284455) | Cod sursa (job #2903408) | Cod sursa (job #857104) | Cod sursa (job #2167295) | Cod sursa (job #2359709)
#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;
}