Cod sursa(job #830716)
Utilizator | Data | 7 decembrie 2012 15:45:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a, int b)
{
while (b > 0) {
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int n, a, b;
in >> n;
for (int i = 0; i < n; i++) {
in >> a >> b;
out << cmmdc(a, b) << '\n';
}
return 0;
}