Cod sursa(job #2429306)
Utilizator | Data | 9 iunie 2019 00:03:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int cmmdc(int a, int b) {
if (!a) {
return b;
}
return cmmdc(b % a, a);
}
int main() {
int T, a, b;
in >> T;
for (int i = 0 ; i < T ; ++i) {
in >> a >> b;
out << cmmdc(a, b);
}
return 0;
}