프로그래머스 최대공약수와 최소공배수

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int n, int m) {
    vector<int> answer;
    int smaller;
    if(n>m) smaller = n;
    else smaller= m;
    int tmpans = 0;
    for(int i = 1; i <= smaller; i++)
    {
        if (n % i == 0 && m % i == 0)
            tmpans = i;       
    }
    answer.push_back(tmpans);
    answer.push_back( (n/tmpans) * (m/tmpans) * (tmpans));
    return answer;
}

28527