Cod sursa(job #1387769)
Utilizator | Data | 14 martie 2015 17:39:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
int gcd (int a, int b) {
if (b == 0) {
return b;
} else {
return gcd (b, a % b);
}
}
int main() {
std::ifstream in;
std::ofstream out;
int num, a, b;
in.open ("euclid.in");
in.open ("euclid.out");
in >> num;
for (int i = 0; i < num; ++i) {
in >> a;
in >> b;
out << gcd (a, b) << "\n";
}
in.close();
out.close();
}