Cod sursa(job #2125712)
Utilizator | Data | 8 februarie 2018 17:51:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
int gcd(int a, int b) {
int t;
while (b) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main(void) {
std::ifstream f("euclid2.in");
std::ofstream o("euclid2.out");
int T, a, b;
f >> T;
for (; T; T--) {
f >> a >> b;
o << gcd(a, b) << std::endl;
}
return 0;
}