[CodeUp] #4506-최대공약수와 최소공배수(정올 1번 수준 문제)

#include <iostream>
#include <cmath>
using namespace std;
int x,y=1;

void gcd(int a, int b){
    if(b==0){
        x = a;
        return;
    }
    else{
        a = a%b;
        if(a<b){
            int temp = a;
            a = b;
            b = temp;
        }
    }
    gcd(a,b);
    return;
}

void lcd(int a, int b){
    y = x*(a/x)*(b/x);
}

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

    if(a>b){
        gcd(a,b);
        lcd(a,b);
    }
    else{
        gcd(b,a);
        lcd(a,b);
    }

    cout << x << "\n" << y;

}