Pagini recente » Cod sursa (job #2019395) | Cod sursa (job #2203181) | Cod sursa (job #478092) | Istoria paginii runda/23/clasament | Cod sursa (job #2767146)
#include <iostream>
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int euclid(int number1, int number2) {
if (number1 == 0) {
return number2;
} else {
return euclid(number2 % number1, number1);
}
}
int main(void) {
int n;
fin >> n;
for (int i = 0; i < n; ++i) {
int number1, number2;
fin >> number1 >> number2;
fout << euclid(number1, number2);
fout << "\n";
}
fin.close();
fout.close();
return 0;
}