Cod sursa(job #2631342)
Utilizator | Data | 29 iunie 2020 22:39:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int cmmdc(int x, int y)
{
if(!y) return x;
return cmmdc(y, x%y);
}
int main()
{
ifstream f;
ofstream g;
int n, a, b;
f.open("euclid2.in");
g.open("euclid2.out");
f >> n;
for(int i = 1; i <= n; i++)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
f.close();
g.close();
return 0;
}