Cod sursa(job #2232325)
Utilizator | Data | 18 august 2018 16:21:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <iostream>
using namespace std;
int GCD(int a, int b)
{
if (b == 0)
{
return a;
}
return GCD(b, a % b);
}
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
int T, a, b;
f >> T;
while (T--)
{
f >> a >> b;
g << GCD(a, b) << '\n';
}
f.close();
g.close();
return 0;
}