Cod sursa(job #936817)
Utilizator | Data | 8 aprilie 2013 21:05:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, a, b;
int cmmdc(int a, int b)
{
if (b == 0)
return a;
return cmmdc(b, a % b);
}
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> a >> b;
fout << cmmdc(a, b) << "\n";
}
fin.close();
fout.close();
return 0;
}