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 (GCC 5.4.1) (judge verdict: Accepted)

#include <malloc.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//ABC99C
int main(void) {
  int n, k, i, cou=0, tmp, six[10], nin[10];
  scanf("%d", &n);
  int dp[n+1];
  for(i=0; i<10; i++){
    six[i]=pow(6, i+1), nin[i]=pow(9, i+1);
  }

  for(i=0; i<=n; i++){
    dp[i]=i;
  }
  for(i=1; i<=n; i++){
    k=0;
    while(i-six[k]>=0){
      dp[i]=dp[i]>dp[i-six[k]]+1 ? dp[i-six[k]]+1 : dp[i];
      k++;
    }
    k=0;
    while(i-nin[k]>=0){
      dp[i]=dp[i]>dp[i-nin[k]]+1 ? dp[i-nin[k]]+1 : dp[i];
      k++;
    }
  }
  //for(i=0; i<=n; i++) printf("dp[%d]=%d\n", i, dp[i]);
  printf("%d", dp[n]);
}