uva 11137 - Ingenuous Cubrency 立方数之和 递推

立方数之和:

https://uva.onlinejudge.org/external/111/11137.pdf

ll dp[maxn];
int main()
{
    int x;
    memset(dp,0,sizeof dp);
    dp[0]=1;
    for(int i=1;i<=21;i++)
    {
        int add=pow(i,3)+0.05;  //防止精度损失的处理，如果写成 int add=pow(i,3);就是错的，这里可以写成i*i*i;
        for(int j=add;j<=10000;j++)
        {
            dp[j]+=dp[j-add];
        }
    }
     while(~scanf("%d",&x))
     {
         printf("%lld\n",dp[x]);
     }

    return 0;
}

头文件：

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n)  for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n)  for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n)  for(int i=(n) ;i>=0 ;i--)
#define  lson   num<<1,le,mid
#define rson    num<<1|1,mid+1,ri
#define MID   int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk    make_pair
#define _f     first
#define _s     second

using namespace std;
const int INF =0x3f3f3f3f;
const int maxn=10000+10    ;
//const int maxm=    ;
//const int INF=    ;
typedef long long ll;
const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
//by yskysker123  22