UVA 11137 - Ingenuous Cubrency(简单背包问题)

#include <iostream>#include <cstdio>#include <cstring>#include <queue>#define M 10000+10using namespace std;long long C,v[M],dp[M];void solve(){    memset(dp,0,sizeof(dp));    dp[0]=1;    for(int i=1; i<=21; i++)    {        for(int j=v[i]; j<=C; j++)        {            dp[j]+=dp[j-v[i]];        }    }}int main(){    for(int i=1; i<=21; i++) v[i]=i*i*i;    while(cin>>C)    {        solve();        cout<<dp[C]<<endl;    }    return 0;}