UVA 11137 - Ingenuous Cubrency

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 (= 21 ³ ), 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 1cube 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

---

P. Rudnicki, from folklore

题目大意：求将n写成若干个正整数的立方和的方法数

解题思路：

dp[i][j] 记录最大的数不超过i，和为j的方法数

则dp[i][j]=dp[i-1][j]+dp[i][j-i^3]

#include <iostream>
using namespace std;

long long dp[25][10010];

void ini(){
	dp[0][0]=1;
	for(int i=1;i<=21;i++){
		for(int j=0;j<=10000;j++){
			if(j>=i*i*i) dp[i][j]=dp[i-1][j]+dp[i][j-i*i*i];
			else dp[i][j]=dp[i-1][j];
		}
	}
}

int main(){
	ini();
	int n;
	while(cin>>n){
		cout<<dp[21][n]<<endl;
	}
	return 0;
}

转载于:https://www.cnblogs.com/toyking/p/3797370.html