Cod sursa(job #2811255)
Utilizator | Data | 1 decembrie 2021 17:24:59 | |
---|---|---|---|
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;
int GCD(int a, int b) {
if (b == 0) {
return a;
}
return 1 * GCD(b, a % b);
}
int main() {
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int a, b, t;
fin >> t;
for (int i = 1; i <= t; i++) {
fin >> a >> b;
fout << GCD(a, b) << '\n';
}
return 0;
}