Submission #8805408

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI = 1000000007;


int main(){
  int N;
  cin >> N;
  int ans=N;
  for(int i=0; i<=N; i++){
    int count=0;
    int t=i;
    while(t>0){
      count += t%6;
      t /= 6;
    }
    t = N-i;
    while(t>0){
      count += t%9;
      t /= 9;
    }
    ans = min(ans,count);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result