Cod sursa(job #2431792)
| Utilizator | Data | 20 iunie 2019 19:15:38 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (!a) {
return b;
}
return gcd(b % a, a);
}
int main() {
int T, A, B;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
fin >> T;
for (int i = 0; i < T; ++i) {
fin >> A >> B;
fout << gcd(A, B) << endl;
}
return 0;
}