Cod sursa(job #877491)
Utilizator | Spinei Dionis SPDionis | Data | 12 februarie 2013 21:48:45 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using std::ifstream;
using std::endl;
using std::ofstream;
int cmmdc(int a, int b)
{
if ( b == 0 ) return a;
return cmmdc(b, a % b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int N;
in >> N;
int a,b;
for (int i = 0; i < N; ++i)
{
in >> a >> b;
out << cmmdc(a,b) << endl;
}
in.close();
out.close();
return 0;
}