Cod sursa(job #2508910)
| Utilizator | Data | 13 decembrie 2019 13:50:59 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdcEuclid(long long a, long long b) {
while (a != b)
if (a > b) a = a - b;
else b = b - a;
return a;
}
int main() {
int T;
long long a, b;
fin >> T;
for (int i = 1; i <= T; i++)
{
fin >> a >> b;
fout << cmmdcEuclid(a, b) << "\n";
}
}