Cod sursa(job #234993)
Utilizator | 000000 mist | Data | 22 decembrie 2008 13:46:18 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
long cmmdc(long a, long b)
{
long r;
while (b != 0) {
if (a < b) {
r = b % a;
}
else {
r = a % b;
a = b;
}
b = r;
}
return a;
}
int main()
{
long T;
ifstream in("euclid2.in");
in >> T;
ofstream out("euclid2.out");
for (long i = 0; i < T; i++) {
long a, b;
in >> a >> b;
out << cmmdc(a, b) << endl;
}
in.close();
out.close();
return 0;
}