HDU 1398 Square Coins 整数拆分变形 母函数

欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励）

Square Coins

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

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,

就只需要改2个地方。 在i遍历表达式时（可以参考我的资料—《母函数详解》），把i<=nNum改成了i*i<=nNum,其次在k遍历指数时把k+=i变成了k+=i*i; Ok,说来说去还是套模板~~~

#include<stdio.h>
#include<string.h>
int c[1000],temp[1000];
int main(){
   int n;
   while(scanf("%d",&n)&&n){
       memset(c,0,sizeof(c));
       memset(temp,0,sizeof(temp));
       for(int i=0;i<=n;i++)
        c[i]=1;
       for(int i=2;i*i<=n;i++){
          for(int j=0;j<=n;j++){
            for(int k=0;k+j<=n;k+=i*i)
                temp[k+j]+=c[j];
          }

        for(int ii=0;ii<=n;ii++){
            c[ii]=temp[ii];
            temp[ii]=0;

        }
       }
    printf("%d
",c[n]);
   }
   return 0;
}

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