Submission #2650185

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>

std::vector<int64_t> sixs;
std::vector<int64_t> nines;

int solves(int n) {
  if (n < 6)
    return n;
  auto six_itr = std::upper_bound(sixs.begin(), sixs.end(), n);
  six_itr--;
  auto nine_itr = std::upper_bound(nines.begin(), nines.end(), n);
  if (nine_itr == nines.begin())
    return solves(n-*six_itr) + 1;
  nine_itr--;
  return std::min(solves(n-*six_itr), solves(n-*nine_itr)) + 1;
}

int main () {
  int n;
  std::cin >> n;
  for (int i = 0; i < 7; ++i) {
    sixs.push_back((int)std::pow(6.0, i));
  }
  for (int i = 0; i < 6; ++i) {
    nines.push_back((int)std::pow(9.0, i));
  }
  std::cout << solves(n) << std::endl;
}

Submission Info

Judge Result