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

 1 #define mm(a) memset(a,0,sizeof(a));
 2 #define max(x,y) (x)>(y)?(x):(y)
 3 #define min(x,y) (x)<(y)?(x):(y)
 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
 5 #define rep(i,a,b) for(int i=(a);i<=(b);i++)
 6 #define per(i,b,a) for(int i=(b);i>=(a);i--)
 7 #include<bits/stdc++.h>
 8 typedef long long ll;
 9 #define PII pair<int,int>
10 using namespace std;
11 const int INF=0x3f3f3f3f;
12 const int MAXN=(int)1e6 + 5;
13 const ll mod=1e9+7;
14 
15 
16 int n;
17 bool vis[MAXN];
18 queue<pair<int, int>> q;
19 int gao(int n) {
20     while(!q.empty())q.pop();
21     mm(vis);
22     q.push(make_pair(n, 0));
23     vis[n]=1;
24     while(!q.empty()) {
25         PII now=q.front();
26         q.pop();
27         if (now.first==0) return now.second;
28         for (int i=1; i*i*i<=now.first; i++) {
29             int a=now.first-i*i*i;
30             if (a==0)return now.second+1;
31             if (!vis[a]) {
32                 q.push(make_pair(a,now.second+1));
33                 vis[a]=1;
34             }
35         }
36     }
37 }
38 
39 int main() {
40     while(~scanf("%d",&n))printf("%d\n",gao(n));
41     return 0;
42 }

 

转载于:https://www.cnblogs.com/dogenya/p/10815612.html