Cod sursa(job #2436191)
Utilizator | Data | 4 iulie 2019 22:09:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T, a, b;
int GCD(int a, int b) {
if (!b)
return a;
return GCD(b, a % b);
}
int main() {
fin >> T;
for (; T; --T) {
fin >> a >> b;
fout << GCD(a, b) << '\n';
}
}