UVa 11137 - Ingenuous Cubrency (递推 DP 多重背包 )

UVA - 11137

Ingenuous Cubrency

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]  

Description

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 1 cube coins, or one 8 cube coin and thirteen 1cube 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

[Submit]   [Go Back]   [Status]  

题意：

求将ｎ写为若干个立方数之和的方案数。

相当于多重背包

dp[i][j]表示用最大为ｉ的数来组成ｊ的方案数

则　dp[i][j] = dp[i-1][j] + dp[i][j-i*i*i] （用或者不用ｉ*ｉ*ｉ）

可以用滚动数组优化一下

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>

using namespace std;

//#define WIN
#ifdef WIN
typedef __int64 LL;
#define iform "%I64d"
#define oform "%I64d\n"
#define oform1 "%I64d"
#else
typedef long long LL;
#define iform "%lld"
#define oform "%lld\n"
#define oform1 "%lld"
#endif

#define S64I(a) scanf(iform, &(a))
#define P64I(a) printf(oform, (a))
#define P64I1(a) printf(oform1, (a))
#define REP(i, n) for(int (i)=0; (i)<n; (i)++)
#define REP1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FOR(i, s, t) for(int (i)=(s); (i)<=(t); (i)++)

const int INF = 0x3f3f3f3f;
const double eps = 10e-9;
const double PI = (4.0*atan(1.0));

const int maxn = 10000 + 20;
LL dp[maxn];

int main() {
    int n;

    memset(dp, 0, sizeof(dp));
    dp[0] = 1;
    for(int i=1; i<22; i++) {
        for(int j=i*i*i; j<maxn; j++) {
            dp[j] += dp[j-i*i*i];
        }
    }
    while(scanf("%d", &n) != EOF) {
        P64I(dp[n]);
    }

    return 0;
}