Cod sursa(job #2200235)
Utilizator | Data | 30 aprilie 2018 17:39:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout("euclid2.out");
int CMMDC(int a, int b);
int a, b, n;
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> a >> b;
if (a > b)
cout << CMMDC(a, b) << '\n';
else
if (a == b)
cout << a << '\n';
else
cout << CMMDC(b, a) << '\n';
}
}
int CMMDC(int a, int b)
{
if (a == 0)
return b;
if (b == 0)
return a;
CMMDC(b, a % b);
}