Cod sursa(job #2646248)
Utilizator | Data | 31 august 2020 15:38:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long CMMDC(long a, long b)
{
if (a == 0)
return b;
else if (b == 0)
return a;
else if (a > b)
return CMMDC(a % b, b);
else
return CMMDC(a, b % a);
}
int main()
{
long T, nr1, nr2;
fin >> T;
for (int i = 1; i <= T; ++i)
{
fin >> nr1 >> nr2;
fout << CMMDC(nr1, nr2) << endl;
}
return 0;
}