Cod sursa(job #1554690)
Utilizator | Data | 21 decembrie 2015 16:53:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b) {
while (b != a)
{
if (a > b)
a = a - b;
else
b = b - a;
}
return a;
}
int main() {
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int t, i, a, b;
in >> t;
for (i = 1; i <= t; i++)
{
in >> a >> b;
out << cmmdc(a, b) << '\n';
}
}