ACM: 数学题 uva_11137

Problem I: Ingenuous Cubrency

People in Cubeland use cubic coins. Not only the unit of currency is called a cube but also the coins are shaped like cubes and their values are cubes. Coins with values of all cubic numbers up to 9261 (= 213), i.e., coins with the denominations of 1, 8, 27, ..., up to 9261 cubes, are available in Cubeland. 

Your task is to count the number of ways to pay a given amount using cubic coins of Cubeland. For example, there are 3 ways to pay 21 cubes: twenty one 1 cube coins, or one 8 cube coin and thirteen 1 cube coins, or two 8 cube coin and five 1 cube coins. 

Input consists of lines each containing an integer amount to be paid. You may assume that all the amounts are positive and less than 10000. 

For each of the given amounts to be paid output one line containing a single integer representing the number of ways to pay the given amount using the coins available in Cubeland. 

Sample input

10 

21

77

9999

Output for sample input

2

3

22

440022018293

题意: 计算整数n能有多少种组合是通过一系列整数的立方和而得.

解题思路:

      1. 可以有多阶段图而得, 设dp[i][j]表示小于i的整数的立方和, 得到j的路径数目.

          多阶段图的起点显然是dp[0][0] = 1; 题目给出的范围是10000; 22^3 > 10000

          那么结果是dp[21][n];

代码:

#include <cstdio>

#include <iostream>

#include <cstring>

using namespace std;

#define MAX 10005

int n;

long long dp[22][MAX];

void init()

{

memset(dp, 0, sizeof(dp));

dp[0][0] = 1;

for(int i = 1; i < 22; ++i)

{

for(int j = 0; j < MAX; ++j)

{

for(int a = 0; j+a*i*i*i < MAX; ++a)

dp[i][j+a*i*i*i] += dp[i-1][j];

}

}

}

int main()

{

init();

// freopen("input.txt", "r", stdin);

while(scanf("%d", &n) != EOF)

{

printf("%lld\n", dp[21][n]);

}

return 0;

}