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

https://www.acmicpc.net/problem/1934

#include <iostream>

using namespace std;

int main() {

int n;

cin >> n;

int **ary = new int*[n];

int a, b;

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

ary[i] = new int[3];

cin >> ary[i][0] >> ary[i][1];

}

int cnt;

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

cnt = ary[i][0] > ary[i][1] ? ary[i][1] : ary[i][0];

while (cnt!=1) {

if ((ary[i][0] %cnt == 0) && (ary[i][1] %cnt == 0))

break;

cnt--;

}

cout << ary[i][0] * ary[i][1] / cnt << "\n";

}

}