hdu1398 Square Coins(组合)



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
  
  
  
  

   
   题意：有19个硬币，币值分分别为1^2,2^2,...,17^2,给出一个不大于300的币值，问有多少种组合方法
  
  
  
  

   
   思路：是组合问题，用母函数就可解决
先计算用用币值为1的组合数，然后计算用币值1，4的组合数，依此类推，直到用1，4，...,289构成所需币值的组合数
  
  
  
  

   
   代码如下
  
  
  
  

   
   
import java.io.FileInputStream;
import java.io.OutputStreamWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main implements Runnable
{  
    private static final boolean DEBUG = false;
    private Scanner cin;
    private PrintWriter cout;
    private static final int N = 301;
    private static final int[] coins = new int[]{1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289};
    private static int n;
    private static int[] a = new int[N], b = new int[N];
   
    private void init()
    {
        try {
            if (DEBUG) {
                cin = new Scanner(new InputStreamReader(new FileInputStream("f:\\OJ\\uva_in.txt")));
            } else {
                cin = new Scanner(new InputStreamReader(System.in));
            }
            
            cout = new PrintWriter(new OutputStreamWriter(System.out));
            
           for (int i = 0; i < N; i++) {
               a[i] = 1;
               b[i] = 0;
           }
           
           for (int i = 1; i < 17; i++) {
               for (int j = 0; j < N; j++) {
                   for (int k = 0; j + k < N; k += coins[i]) {
                       b[j + k] += a[j];
                   }
               }
               
               for (int j = 0; j < N; j++) {
                   a[j] = b[j];
                   b[j] = 0;
               }
           }
        } catch (Exception e) {
            e.printStackTrace();
        }  
    }
    
    private boolean input()
    {
       n = cin.nextInt();
       if (n == 0) return false;
       
        return true;
    }
    
    private void solve()
    {
      cout.println(a[n]);
      cout.flush();
    }
    
    @Override
    public void run()
    {
        init();
        
        while (input()) 
        {
            solve();
        }
    }
    
    public static void main(String[] args) 
    {
        // TODO code application logic here
       new Thread(new Main()).start();
    }
}