Cod sursa(job #1889234)
Utilizator | Data | 22 februarie 2017 17:16:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
int cmmdc(int a, int b) {
if (!b) return a;
return cmmdc(b, a%b);
}
int main(void) {
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int n;
in >> n;
for (int i = 0; i < n; i++) {
int a, b;
in >> a >> b;
out << cmmdc(a, b) << "\n";
}
in.close();
out.close();
return 0;
}