hdu1398 -Square Coins

本题的母函数为s=(1+x+x^2+x^3+.....+x^n)*(1+x^4+x^8+......+x^4*n)*(1+x^9+x^18+......+x^9*n)

b本题的大意就是有价值分别为1,4,9的硬币。给你一个数值，让你求用这三种硬币凑成这个数值组合方法有多少种。不计每种硬币的个数，只要能凑够，不限制你用多少个硬币。  本题跟1028神似。直接可用那个模板。

Square Coins

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

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
  
  
  
  

   
    
  
  
  
  

   
   AC代码：
  
  
  
  

   
   
#include<stdio.h>
#include<string.h>
int c1[10000],c2[10000];
int main()
{
    int n,i,j,k;
    while(scanf("%d",&n)&&n!=0)
    {
        memset(c1,0,sizeof(c1));
        memset(c2,0,sizeof(c2));
        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;j+k<=n;k+=i*i){ //  就只在此处做了改动。其他和1028代码完全一样。 
               c2[j+k]+=c1[j];
             }
          }
              for(j=0;j<=n;j++){
                    c1[j]=c2[j];
                    c2[j]=0;            
              }
        }
        printf("%d\n",c1[n]);
    }
    return 0;
}