Cod sursa(job #615811)
Utilizator | Data | 10 octombrie 2011 22:47:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
if (a%b==0)
return b;
else
return euclid (b, a%b);
}
int main()
{
ifstream in("euclid2.in");
int n;
in >> n;
ofstream out("euclid2.out");
int t1, t2;
for (;n;--n)
{
in >> t1 >> t2;
out << euclid (t1, t2) << endl;
}
in.close();
out.close();
return 0;
}