Cod sursa(job #2362444)
| Utilizator | Data | 3 martie 2019 10:47:19 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b) {
if (!b)
return a;
return cmmdc(b, a%b);
}
int main() {
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T, a, b;
f >> T;
for (int i = 1; i <=T; i++) {
f >> a >> b;
g << cmmdc(a, b) << endl;
}
f.close();
g.close();
return 0;
}
