Cod sursa(job #1841004)
Utilizator | Data | 5 ianuarie 2017 06:11:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
int r1 = (a > b) ? (a % b) : (b % a);
while (r1)
{
a = b;
b = r1;
r1 = a % b;
}
return b;
}
int main()
{
int a, b, t;
f >> t;
for (int i = 0; i < t; ++i)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
f.close();
g.close();
return 0;
}