【小米oj】 需要多少个立方数

#define mm(a) memset(a,0,sizeof(a));
#define max(x,y) (x)>(y)?(x):(y)
#define min(x,y) (x)<(y)?(x):(y)
#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#include<bits/stdc++.h>
typedef long long ll;
#define PII pair<int,int>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=(int)1e6 + 5;
const ll mod=1e9+7;


int n;
bool vis[MAXN];
queue<pair<int, int>> q;
int gao(int n) {
    while(!q.empty())q.pop();
    mm(vis);
    q.push(make_pair(n, 0));
    vis[n]=1;
    while(!q.empty()) {
        PII now=q.front();
        q.pop();
        if (now.first==0) return now.second;
        for (int i=1; i*i*i<=now.first; i++) {
            int a=now.first-i*i*i;
            if (a==0)return now.second+1;
            if (!vis[a]) {
                q.push(make_pair(a,now.second+1));
                vis[a]=1;
            }
        }
    }
}

int main() {
    while(~scanf("%d",&n))printf("%d
",gao(n));
    return 0;
}