关闭

HDU 1398 (母函数)

标签: 母函数
111人阅读 评论(0) 收藏 举报
分类:

Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11363 Accepted Submission(s): 7783

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

Sample Output
1
4
27

题意:对于 1^2 , 2^2, 3^2, 4^2, ….., 17^2, 输入一个数 n, 求 n 的组合数
题解:用母函数的方法,至于母函数是什么,这个还是看百度或者课件什么的

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 400

int num2[M], num[M];
void getnum()//打表
{
    int flag[18];
    for(int i=0; i<18; i++)
        flag[i] = i * i;
    for(int i=0; i<M; i++)
    {
        num[i] = 1;
        num2[i] = 0;
    }
    for(int i=2; i<18; i++)//对于每一个 n ,都可能由 i^2 组成
    {
        for(int j=0; j<M; j++)//枚举每一个数
        {
            for(int k=0; k+j<M; k+=flag[i])//跳转的距离是flag[i] 
            {
                num2[k+j] += num[j];//加上的数值是每一个跳转距离的那个数 
            }
        }
        for(int j=0; j<M; j++)
        {
            num[j] = num2[j];//更新每一个数值 
            num2[j] = 0;
        }
    }
}

int main()
{
    int n;
    getnum();
    while(scanf("%d", &n) && n)
    {
        printf("%d\n", num[n]);
    }

    return 0;
}
0
0
查看评论

hdu1790(母函数的简单应用)

题意:给n个砝码,每个砝码的质量为Hi,[1,S]内无法用这些砝码称出的质量 这里砝码是有限的,母函数为(1 + x^h1)(1 + x^h2)(1 + x^h3)......... 还有一点要注意的是砝码可以放在天平的两边,比如2,3可以称得1 #include #include #in...
  • u013509299
  • u013509299
  • 2014-07-17 22:45
  • 633

hdu 1398 普通母函数

题目传送门:点击打开链接  这道题其实就是模版题,唯一不同的是每一项的指数不同,所以在模版里最外层的 不是i++,而是1,4,9,16....17^2,i代表的是第i种硬币类型,这种类型的硬币能提供价值为i*1,i*2,i*3。。还有不懂的可以看一下代码,如果在不懂我想你可以看一下点击打...
  • S1766434333
  • S1766434333
  • 2016-10-30 20:41
  • 138

hdu 1398 母函数 (三)

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4205 ...
  • acmmsdn
  • acmmsdn
  • 2012-02-03 10:46
  • 166

hdu 1398(普通型母函数)

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4675 ...
  • jiakai0419
  • jiakai0419
  • 2012-05-01 15:05
  • 188

hdu 1398 (母函数)

母函数。。。。 #include using namespace std; int main() { int n; int c1[305],c2[305]; while(scanf("%d",&n)==1&&n) { for(in...
  • u010087314
  • u010087314
  • 2013-04-07 20:38
  • 283

hdu(1398)母函数

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12049 &...
  • hz18790581821
  • hz18790581821
  • 2017-04-10 15:24
  • 191

母函数 hdu 1398

<br />/*母函数G(x)=(1+x+x2+x3+x4+…)(1+x4+x8+x12+…)(1+x9+x18+x27+…)… hdu1398 */ #include <iostream> using namespace std; const int lmax=3...
  • xyzhk01
  • xyzhk01
  • 2010-07-21 11:29
  • 293

hdu 1398 母函数

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12900 ...
  • aaaliaosha
  • aaaliaosha
  • 2017-08-30 09:14
  • 62

HDU 1398 母函数

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9989 ...
  • mkandysylove
  • mkandysylove
  • 2015-11-01 15:17
  • 84

hdu 1398 母函数初学

#include #include #include #include #include #include #include #include using namespace std; int main() { int a[320],b[320],i,j,k,n; while(cin...
  • ronghuayang123
  • ronghuayang123
  • 2013-03-25 21:00
  • 316
    个人资料
    • 访问:26630次
    • 积分:1755
    • 等级:
    • 排名:千里之外
    • 原创:154篇
    • 转载:4篇
    • 译文:0篇
    • 评论:9条
    最新评论