Cod sursa(job #2642524)
Utilizator | Data | 15 august 2020 19:26:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream input("euclid2.in");
ofstream output("euclid2.out");
int cmmdc(int a, int b) {
if (a == 0 || b == 0) return 0;
while (a != b) {
a -= b;
return cmmdc(b, a);
}
return a;
}
int main()
{
int T, a, b, r;
input >> T;
for (int i = 0; i < T; i++) {
input >> a >> b;
if (a > b) r = cmmdc(a, b);
else r = cmmdc(b, a);
output << r;
}
input.close();
output.close();
}