Cod sursa(job #1331953)
Utilizator | Data | 1 februarie 2015 14:09:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
int gcd(int a, int b) {
return 0 == b ? a : gcd(b, a % b);
}
int main() {
ifstream in{"euclid2.in"};
ofstream out{"euclid2.out"};
int T, a, b;
for(in >> T; T; --T) {
in >> a >> b;
out << gcd(a, b) << '\n';
}
return 0;
}