Square Coins（母函数）

题目描述：

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.

Sample Input：

2
10
30
0 

Sample Output:

1
4
27 

具体代码：

#include <iostream>
#include<stdio.h>
const int max1=301;
using namespace std;
int a[max1],b[max1];
int main()
{
    int n;
    while( scanf("%d",&n))
    {
        if(n==0)
            break;
        for(int i=0;i<=n;i++)
        {
            a[i]=1;//初始化,可以为1
            b[i]=0;
        }//初始化
        for(int i=2;i<=17;i++)//第二个开始，1初始，最多是17次
        {
            for(int j=0;j<=n;j++)
                for(int k=0;k+j<=n;k+=i*i)//平方
            {
                b[k+j]+=a[j];//后大括号和前一个大括号相加（乘）
            }
            for(int j=0;j<=n;j++)
            {
                a[j]=b[j];
                b[j]=0;
            }
        }
        printf("%d\n",a[n]);

    }
    return 0;
}