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.

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.

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.

2
10
30
0

1
4
27

只是指数发生变化，还是简单的母函数模板。

//考察知识点：母函数模板变形--平方幂 

#include<stdio.h>
int c1[330],c2[330]; 
int main()
{
	int n;
	while(~scanf("%d",&n),n)
	{
		int i,j,k;
		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;k+j<=n;k+=i*i)//普通母函数唯一变化之处 
				{
					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;
}