백준 2609번 : 최대공약수와 최소공배수

#include <iostream>
using namespace std;

int gcd(int a, int b) {
    while (b != 0) {
        int temp = a % b;
        a = b;
        b = temp;
    }
    return a;
}

int lcm(int a, int b, int gcd_value) {
    return a * b / gcd_value;
}

int main() {
    int a, b;
    cin >> a >> b;

    int gcd_value = gcd(a, b);
    int lcm_value = lcm(a, b, gcd_value);

    cout << gcd_value << '\n';
    cout << lcm_value << '\n';
}