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

programmers.co.kr/learn/courses/30/lessons/68935

#include <vector>
#include <cmath>
using namespace std;

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