[C++] 백준 1934. 최소공배수

#include <iostream>

using namespace std;

int main() {

int n;

cin >> n;

int input[2*n];

for (int i = 0; i < 2*n; i+=2) {

cin >> input[i] >> input[i+1];

}

for (int i = 0; i < 2*n; i+=2) {

int a = input[i];

int b = input[i+1];

int min, max;

int r = 0;

if (a > b) {

max = a;

min = b;

}

else if (a == b) {

cout << a << endl;

continue;

}

else {

max = b;

min = a;

}

// Euclidean algorithm

while(max % min != 0) {

r = max % min;

max = min;

min = r;

}

cout << a*b/min << endl;

}

}

참고 : 위키백과