Cod sursa(job #1983889)
Utilizator | Diles Miles dilesmavis | Data | 22 mai 2017 18:46:01 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int maxDivizorComun(int numA, int numB) {
if (numB == 0) {
return numA;
}
return maxDivizorComun(numB, numA % numB);
}
int main() {
int T;
in >> T;
for (int i = 1; i <= T; i++) {
int numA;
int numB;
in >> numA;
in >> numB;
out << maxDivizorComun(numA, numB) << "\n";
}
return 0;
}