Cod sursa(job #800146)
| Utilizator | Data | 20 octombrie 2012 20:19:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int GetCMMDC(int, int);
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T;
f >> T;
int a, b, i;
for (i = 1; i <= T; i++)
{
f >> a >> b;
g << GetCMMDC(a, b) << endl;
}
f.close();
g.close();
return 0;
}
int GetCMMDC(int a, int b)
{
while (a != b)
{
if (a > b)
a = a - b;
else
b = b - a;
}
return a;
}
