Cod sursa(job #2307613)
Utilizator | Data | 25 decembrie 2018 02:12:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int gcf(int a, int b)
{
if (a == 0) return b;
else if (b == 0) return a;
else return gcf((b%a), a);
}
int main()
{
ofstream g("euclid2.out");
ifstream f("euclid2.in");
int a, b, T;
f >> T;
for (int i = 1; i <= T; i++)
{
f >> a >> b;
g << gcf(a, b) << endl;
}
f.close();
g.close();
return 0;
}