Cod sursa(job #2660005)
Utilizator | Data | 17 octombrie 2020 23:56:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int tests, a, b;
in >> tests;
for (int i = 0; i < tests; ++i) {
in >> a >> b;
out << gcd(a, b) << '\n';
}
return 0;
}