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 3 ), 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
--------------------


-------------------

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

long long a[33];
long long f[11111];
int n;

int main()
{
    for (int i=1;i<=21;i++)
    {
        a[i]=i*i*i;
    }
    while (~scanf("%d",&n))
    {
        memset(f,0,sizeof(f));
        f[0]=1;
        for (int i=1;i<=21;i++)
        {
            for (int j=0;j<=n-a[i];j++)
            {
                if (f[j]) f[j+a[i]]+=f[j];
            }
        }
        printf("%lld\n",f[n]);
    }
    return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值