[프로그래머스] 최대공약수와 최소공배수 C++ 풀이

https://school.programmers.co.kr/learn/courses/30/lessons/12940?language=cpp 

프로그래머스

전체 코드

#include <string>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> solution(int n, int m) {
    vector<int> answer;
    int minNum=min(n,m);
    int res1;
    
    for(int i=1;i<=minNum;i++)
    {
        if(n%i==0&&m%i==0)
            res1=i;
    }
    answer.push_back(res1);
    
    int cloneR1=res1;
    while(1)
    {
        if(cloneR1%n==0&&cloneR1%m==0)
        {
            answer.push_back(cloneR1);
            break;
        }
        cloneR1+=res1;
    }
    
    return answer;
}