[Level 1][C++] 최대공약수와 최소공배수

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int n, int m) {

    int max = (n>m)? n:m;
    int min = (n<m)? n:m;
    
    if(max%min ==0)
        return {min, max};
    else
    {
        for(int i=min-1; i>0; i--)
            if(max%i ==0 && min%i ==0)
                return{i, max*min/i};        
    }
   
}