Cod sursa(job #2923746)
| Utilizator | Data | 18 septembrie 2022 17:41:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int cmmdc(int a, int b)
{
if (a % b == 0)
return b;
return cmmdc(b, a % b);
}
int main()
{
int T, a, b;
fi >> T;
for (int i = 0; i < T; i++)
{
fi >> a >> b;
fo << cmmdc(a, b) << '\n';
}
fi.close();
fo.close();
return 0;
}