hdu 1398完全背包

最新推荐文章于 2018-12-14 10:32:38 发布

原创最新推荐文章于 2018-12-14 10:32:38 发布 · 563 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#完全背包

完全背包专栏收录该内容

7 篇文章

订阅专栏

Problem Description

People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland.
There are four combinations of coins to pay ten credits:

ten 1-credit coins,
one 4-credit coin and six 1-credit coins,
two 4-credit coins and two 1-credit coins, and
one 9-credit coin and one 1-credit coin.

Your mission is to count the number of ways to pay a given amount using coins of Silverland.

Input

The input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300.

Output

For each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output.

Sample Input

Sample Output

1
4
27

题目大意：有1平方 2平方。。。。17平方 17个数，现在给你一个小于等于300的数，让你求有多少种用17个数组成此数的方法。

完全背包问题，dp[0] = 1因为组成0的只有一种方法，就是什么都没有。dp[j] = dp[j] + dp[j - price[i]]; 公式很简单

#include <stdio.h>
#include <string.h>

int dp[301];

int price[18];

int main(void)
{
    int n;
    int i, j;

    for (i = 1; i <= 17; i++)
    {
        price[i] = i * i;
    }

    memset(dp, 0, sizeof(dp));
    dp[0] = 1;

    for (i = 1; i <= 17; i++)
    {
        for (j = price[i]; j <= 300; j++)
        {
            dp[j] = dp[j] + dp[j - price[i]] ;
        }
    }

    while (scanf("%d", &n) != EOF && n)
    {
        printf("%d\n", dp[n]);
    }
    return 0;
}