Cod sursa(job #2272060)
| Utilizator | Data | 29 octombrie 2018 17:44:17 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
int cmmdc(int a, int b)
{
while (a != b)
{
if (a > b)
a = a - b;
else
b = b - a;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
ll pairs, x, y;
in >> pairs;
while (!in.eof())
{
in >> x;
in >> y;
out << cmmdc(x, y);
out << "\n";
}
}
