[프로그래머스] 3진법 뒤집기

 

• 풀이

#include <string>
#include <vector>
#include <cmath>

using namespace std;

int solution(int n) {
    int answer = 0;
    vector<int> arr;
    while(n!=0){
        arr.push_back(n%3);
        n /=3;
    }
    int j = arr.size();
    for(int i=0; i<j; i++){
        answer = answer + arr[j-i-1] * pow(3,i);
    }
    return answer;
}