Cod sursa(job #2378723)
Utilizator | Data | 12 martie 2019 16:14:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long int euclid(long int a, long int b) {
if (b == 0)
return a;
return euclid(b, a % b);
}
int main() {
int T, a, b;
in >> T;
for(int i = 1; i <= T; i++) {
in >> a >> b;
out << euclid(a, b) << '\n';
}
return 0;
}