HDU 1398 母函数

Square Coins

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
  
  
  
  

   
    
  
  
  
  

   
   题意：
  
  
  
  

   
   题目限制只能使一个数的平方，例如放n=9时，
  
  
  
  

   
   9的拆分数是这样算的：（1+x+x62+x^3）(1+x^4+x^8)(1+x^9)中x^9的系数
  
  
  
  

   
   套用母函数模板，把其中的(i=2;i<=n;i++)改成(i=2;i*i<=n;i++)
  
  
  
  

   
   在k遍历时候，k+=i改成k+=i*i..
  
  
  
  

   
    
  
  
  
  

   
   
#include <iostream>
using namespace std;
int c1[1111],c2[1111];
int mamafun(int n)//母函数
{
	int i,j,k;
	for(i=0;i<=n;i++)
		c1[i]=1,c2[i]=0;//初始化第一个式子(1+x+x^2+x^3+...)
	for(i=2;i*i<=n;i++)//从第二个才是乘入
	{
		for(j=0;j<=n;j++)
			for(k=0;k+j<=n;k+=i*i)//k+=i:(1+x+x^2+x^3..)、(1+x^2+x^4..)、(1+x^3+x^6+..)..
				c2[k+j]+=c1[j];
		for(j=0;j<=n;j++)//乘i-th表达式的结果赋值
			c1[j]=c2[j],c2[j]=0;//c2=0,因为c2每次是从一个表达式中开始的
	}
	return c1[n];
}
int main()
{
	int n;
	while(scanf("%d",&n),n)
		printf("%d\n",mamafun(n));
	return 0;
}