최대공약수와 최소공배수

#include <string>
#include <vector>

using namespace std;

int GCD(int a, int b)//최대공약수
{
    if(b == 0)
    {
        return a;
    }
    else
    {
        return GCD(b, a % b);
    }
}

int LCM(int a, int b)//최소공배수
{
    return (a*b) / GCD(a, b);
}

vector<int> solution(int n, int m) 
{
    vector<int> answer;
    
    answer.push_back(GCD(n, m));
    answer.push_back(LCM(n, m));
    
    return answer;
}