Problem p03329 (C++)

Buggy submission (status: Runtime Error):
// #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
          Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)                                                               \
  cout << #v << ":";                                                           \
  for (auto x : v) {                                                           \
    cout << x << ' ';                                                          \
  }                                                                            \
  cout << endl;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  vector<ll> dp(n + 1, LINF);
  dp[0] = 0;
  rep(i, n + 1) {
    chmin(dp[i + 1], dp[i] + 1);
    ll six = 6;
    while (true) {
      if (n < i + six)
        break;
      chmin(dp[i + six], dp[i] + 1);
      six *= 6;
    }
    ll nine = 9;
    while (true) {
      if (n < i + nine)
        break;
      chmin(dp[i + nine], dp[i] + 1);
      nine *= 9;
    }
  }
  cout << dp[n] << "\n";
}


Fixed submission:
// #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
          Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)                                                               \
  cout << #v << ":";                                                           \
  for (auto x : v) {                                                           \
    cout << x << ' ';                                                          \
  }                                                                            \
  cout << endl;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  vector<ll> dp(n + 1, LINF);
  dp[0] = 0;
  rep(i, n) {
    chmin(dp[i + 1], dp[i] + 1);
    ll six = 6;
    while (true) {
      if (n < i + six)
        break;
      chmin(dp[i + six], dp[i] + 1);
      six *= 6;
    }
    ll nine = 9;
    while (true) {
      if (n < i + nine)
        break;
      chmin(dp[i + nine], dp[i] + 1);
      nine *= 9;
    }
  }
  cout << dp[n] << "\n";
}