Cod sursa(job #3209135)
Utilizator | Hutanu Andrei Leontin Hutanu_Andrei | Data | 2 martie 2024 00:25:04 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n, a, b;
int euclid(int a, int b) {
if (a == 0 || b == 0) {
return a + b;
}
else {
if (a > b) return euclid(a % b, b);
else return euclid(a, b % a);
}
}
int main() {
in >> n;
for (int i = 1; i <= n; i++) {
in >> a >> b;
out << euclid(a, b) << "\n";
}
}