[프로그래머스 1] 최대공약수와 최소공배수 (C/C++)

#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, int gcdNum)
{
    a /= gcdNum;
    b /= gcdNum;
    
    return gcdNum * a * b;
}
 
vector<int> solution(int n, int m) 
{
    vector<int> answer;
    
    // 최대공약수
    int gcdNum = gcd(n, m);
    
    // 최소공배수
    int lcmNum = lcm(n, m, gcdNum);
    
    answer.push_back(gcdNum);
    answer.push_back(lcmNum);
    
    return answer;
}