Cod sursa(job #2641166)
Utilizator | Data | 10 august 2020 13:10:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <iostream>
using namespace std;
int main()
{
int k, n, m, i;
for (cin >> k; k > 0; k--) {
cin >> n >> m;
if (n < m) i = n;
else i = m;
for (; i > 0; i--) {
if (n % i == 0 && m % i == 0) break;
}
cout << i << endl;
}
}