Cod sursa(job #2349845)
Utilizator | Data | 20 februarie 2019 19:35:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int cmmdc(int a, int b) {
while (a && b) {
if (a > b)
a -= b;
else
b -= a;
}
if (a)
return a;
return b;
}
int main() {
int nr = 0;
in >> nr;
for (int i = 0; i < nr; i++) {
int a, b;
in >> a >> b;
out << cmmdc(a, b) << std::endl;
}
return 0;
}