Cod sursa(job #905211)
Utilizator | Data | 5 martie 2013 17:52:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int n, a, b;
int Cmmdc (int a, int b)
{
if (!b)
return a;
else
return Cmmdc (b, a % b);
}
int main ()
{
ifstream fin ("euclid.in");
fin >> n;
ofstream fout ("euclid.out");
for (int i = 0; i < n; ++i)
{
fin >> a >> b;
fout << Cmmdc (a, b) << "\n";
}
fin.close();
fout.close();
return 0;
}