Cod sursa(job #2591418)
Utilizator | Data | 30 martie 2020 15:00:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
std :: ifstream in("euclid2.in");
std :: ofstream out("euclid2.out");
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
int T, A, B;
in >> T;
for (; T; --T) {
in >> A >> B;
out<<gcd(A, B)<<"\n";
}
return 0;
}