HDOJ 1398 母函数

印象盐城大数据竞赛！
Square Coins

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

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

Source
Asia 1999, Kyoto (Japan)

Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1171 1085 2152 2082 1709

---

这个和1028很像，不过题目的意思意思是只有1 4 9 …这样的硬币。所以只需要修改我们选择的项（因为项就是硬币的大小）就行了。

#include<bits/stdc++.h>
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;

const int _max = 10001;   
// c1是保存各项质量砝码可以组合的数目  
// c2是中间量，保存每一次的情况  
int c1[_max], c2[_max];     
int main()  
{   //int n,i,j,k;  
    int nNum;   //   
    int i, j, k;  

    while(cin >> nNum)  
    {  
        if(nNum == 0) break;
        for(i=0; i<=nNum; ++i)   
        {  
            c1[i] = 1;  
            c2[i] = 0;  
        }  
        for(i=2; i*i<=nNum; ++i)  //修改为i*i<=nNum
        {  
            for(j=0; j<=nNum; ++j)     
                for(k=0; k+j<=nNum; k+=i*i)  //修改为k+=i*i; 
                {  
                    c2[j+k] += c1[j];  
                }  
                for(j=0; j<=nNum; ++j)       
                {  
                    c1[j] = c2[j];  
                    c2[j] = 0;  
                }  
        }  
        cout << c1[nNum] << endl;  
    }  
    return 0;  
}