Problem:
Score : 300 points

Problem Statement

To make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:

1 yen (the currency of Japan)

6 yen, 6^2(=36) yen, 6^3(=216) yen, ...

9 yen, 9^2(=81) yen, 9^3(=729) yen, ...

At least how many operations are required to withdraw exactly N yen in total?

It is not allowed to re-deposit the money you withdrew.

Constraints

1 \leq N \leq 100000

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If at least x operations are required to withdraw exactly N yen in total, print x.

Sample Input 1

127

Sample Output 1

4

By withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.

Sample Input 2

3

Sample Output 2

3

By withdrawing 1 yen three times, we can withdraw 3 yen in three operations.

Sample Input 3

44852

Sample Output 3

16

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>

using namespace std;

vector<int> SIX, NIN;

int lft(int k, int q){
    //cout << "PROCESS : "<< k << ' ' << q << endl;
    if(k == 0) return q;
    int ans = 9999999;
    for(int i = 0; i < SIX.size(); i++){
        if(i < SIX.size() -1 && SIX[i+1] > k && SIX[i] <= k){
            ans = lft(k-SIX[i], q+1);
        }
    }
    for(int i = 0; i < NIN.size(); i++){
        if(i < NIN.size() -1 && NIN[i] <= k && NIN[i+1] > k){
            ans = min(ans, lft(k-NIN[i], q+1) );
        }
    }
    return ans;
}

int main()
{
    int ONE = 1, n; cin >> n;
    int cnt = 0;
    SIX.push_back(1);
    for(int i = 6; i  < 100100;){
        SIX.push_back(i);
        i*=6;
    }
    for(int i = 9; i < 100100;){
        NIN.push_back(i);
        i*=9;
    }
    cout << lft(n, 0) << endl;
    return 0;
}