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