HDU 1398 Square Coins(母函数或dp)

Square Coins

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9903    Accepted Submission(s): 6789


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
2 10 30 0
 
 
dp的完全是按照hdu1028的改的,套那个的感觉。
初始化要比1028难一点,不光要所有的都弄成1,因为这次的不是连续的,所有有的就没有递归上,但是后面的数不可能比前面的小,所以每次都加上一个  d [ i ][ i ]= d [ i ][ a [ j ]];
#include<queue>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 333
int a[22],n,d[N][N];

int main()
{
    for(int i=1;i<=17;i++)
        a[i]=i*i;
    for(int i=0;i<=300;i++)
    for(int j=0;j<=300;j++)
        d[i][j]=1;

    for(int i=2;i<=300;i++)
    {
        for(int j=2;j<=17&&a[j]<=i;j++)
        {
            d[i][a[j]]=d[i][a[j-1]]+d[i-a[j]][min(a[j],i-a[j])];
            d[i][i]=d[i][a[j]];
        }
    }
    int i;
    while(cin>>i&&i)
    {
        cout<<d[i][a[(int)sqrt(i)] ]<<endl;
    }
    return 0;
}

 

 
母函数下次弄

转载于:https://www.cnblogs.com/wmxl/p/4783020.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值