Cod sursa(job #1497538)
Utilizator | Data | 6 octombrie 2015 22:11:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
void outputCMMDC(int a, int b) {
int max = a > b ? a : b;
for (int x = max; x >= 2; x--) {
if (a % x == 0 && b % x == 0) {
cout << x << endl;
return;
}
}
cout << "1" << endl;
}
int main() {
int num;
cin >> num;
int i = 0;
int a = 0;
int b = 0;
while (i++ < num) {
cin >> a;
cin >> b;
outputCMMDC(a, b);
}
return 0;
}