Cod sursa(job #2604253)
Utilizator | Data | 22 aprilie 2020 11:42:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
std::ifstream in_file {"euclid2.in"};
std::ofstream out_file {"euclid2.out"};
int T, a, b;
in_file >> T;
for(int i{0}; i < T; ++i) {
in_file >> a >> b;
out_file << gcd(a, b) << std::endl;
}
return 0;
}