UVa 11137 - Ingenuous Cubrency

听取了老大的建议，说记忆化搜索由于数据较大比较费时，所以直接上的递推，过的比较轻松。

 

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>

using namespace std;

int Case, A[25];
long long dp[10005];
int main ( ) {
    for ( int i = 1; i <= 21; ++i )
        A[i] = i * i * i;
    while ( scanf ( "%d", &Case ) == 1 ) {
        memset ( dp, 0, sizeof ( dp ) );
        dp[0] = 1;

        for ( int j = 1; j <= 21; ++j )
            for ( int i = 1; i <= Case; ++i )
                if ( i >= A[j] ) dp[i] += dp[i - A[j]];
        printf ( "%lld\n", dp[Case] );
    }

}