hdu-1398-Square Coins

最新推荐文章于 2020-09-03 23:54:34 发布

凌摩绛霄

最新推荐文章于 2020-09-03 23:54:34 发布

阅读量404

点赞数

分类专栏：母函数

本文链接：https://blog.csdn.net/qq_18062811/article/details/38420339

版权

母函数专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Square Coins

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

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+x+x^2+...+x^n)(1+x^4+x^8+x^12+...)(1+x^9+x^18+x^27+...)...

AC代码：

#include<iostream>
using namespace std;
const int lmax=1000;
int c1[lmax],c2[lmax];
int main()
{
 int n;
 int i,j,k;
 while(~scanf("%d",&n)&&n!=0)
 {
  for(i=0;i<=n;++i)
  c1[i]=1,c2[i]=0;
  for(i=2;i<=n;++i)
  {
   for(j=0;j<=n;++j)
   for(k=0;j+k<=n;k+=i*i)     //  括号内指数每次增加 i^2
   c2[k+j]+=c1[j];
   for(j=0;j<=n;++j)
   c1[j]=c2[j],c2[j]=0;
  }
  printf("%d\n",c1[n]);
 }
 return 0;
}

// 第一道母函数的题目