Cod sursa(job #2155431)
Utilizator | Data | 7 martie 2018 20:44:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int cmmdc(int x, int y)
{
if(y!=0) return cmmdc(y, x%y);
return x;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
f>>n;
for(int i=0, a, b; i<n; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<endl;
}
f.close();
g.close();
return 0;
}