Cod sursa(job #2340130)
Utilizator | Data | 9 februarie 2019 20:06:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (!a)
return b;
else return gcd((b % a), a);
}
int main()
{
int T, a, b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> T;
for (; T; T--)
{
int a, b;
f >> a >> b;
g << gcd(a, b) << endl;
}
f.close();
g.close();
return 0;
}