Cod sursa(job #2351890)
| Utilizator | Data | 22 februarie 2019 19:45:43 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc (int a, int b) {
if (b == 0) {
return a;
} else {
return cmmdc(b, a % b);
}
}
int main()
{
int n;
fin >> n;
for (int i = 0; i < n; i++) {
int a, b;
fin >> a >> b;
fout << cmmdc(a, b) << "\n";
}
return 0;
}
