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

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

#include <iostream>

using namespace std;

int gcd(int a, int b);

int lcm(int a, int b);

int main() {

int T;

cin >> T;

int *A = new int[T];

int *B = new int[T];

for (int i = 0; i < T; i++)

cin >> A[i] >> B[i];

for (int j = 0; j < T; j++)

cout << lcm(A[j], B[j])<<'\n';

delete[] A;

delete[] B;

}

int gcd(int a, int b) {

while (b != 0) {

int c = a % b;

a = b;

b = c;

}

return a;

}

int lcm(int a, int b) {

return a * b / gcd(a, b);

}