Cod sursa(job #2440469)
Utilizator | Alexandru Bobeica zavo | Data | 18 iulie 2019 15:03:19 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int x, int y){
if(y == 0)
return x;
return cmmdc(y, x % y);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int howMany, a, b;
f >> howMany;
for(int i = 0; i < howMany; i++)
{
f >> a >> b;
g << cmmdc(a , b) << "\n";
}
f.close();
g.close();
}