Submission #3016622

---

Source Code Expand

#include<iostream>
#include<cmath>
#include<string>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;

int base_n_dsum(int num, int n)
{
    int ans =0;
    int temp =num;
    while(temp !=0)
    {
        ans += temp %n;
        temp = temp /n;
    }
    return ans;
}

int mpow(int e, int b)
{
    int ans =1;
    for(int i=0; i<e; i++) ans*=b;
    return ans;
}

int main()
{
    int n;
    cin>>n;
    int min=n;
    int temp;
    for(int i=0; i<=n; i++)
    {
        temp= base_n_dsum(i,6) + base_n_dsum(n-i,9);
        if(temp<min) min=temp;
    }
    
    cout<<min<<endl;
    
	return 0;
}

Submission Info

Judge Result