zoukankan      html  css  js  c++  java
  • 题解报告:hdu 1398 Square Coins(母函数或dp)

    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
    解题思路:多种硬币(有币值为1^2,2^2,...,17^2共17种硬币)的组合!解法和此篇博文类似:题解报告:hdu 1284 钱币兑换问题(简单数学orDP)
    AC代码一之dp(0ms):
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     int n,dp[305]={1};
     5     for(int i=1;i<=17;++i)//预处理打表
     6         for(int j=i*i;j<305;++j)
     7             dp[j]+=dp[j-i*i];
     8     while(cin>>n&&n){cout<<dp[n]<<endl;}
     9     return 0;
    10 }

     AC代码二之母函数(15ms):生成函数G(x)=(1+x^1+x^2+...)(1+x^4+x^8+x^12+...)(1+x^9+x^18+...)(...)(1+x^289)。

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int n,c1[305],c2[305];
     4 void init(){
     5     memset(c1,0,sizeof(c1));
     6     memset(c2,0,sizeof(c2));
     7     c1[0]=1;//指数为0的系数为1
     8     for(int i=1;i<=17;++i){
     9         for(int j=0;j<=300;++j)
    10             for(int k=0;k+j<=300;k+=i*i)
    11                 c2[k+j]+=c1[j];
    12         for(int j=0;j<=300;++j)
    13             c1[j]=c2[j],c2[j]=0;
    14     }
    15 }
    16 int main(){
    17     init();
    18     while(~scanf("%d",&n)&&n){printf("%d
    ",c1[n]);}
    19     return 0;
    20 }
  • 相关阅读:
    Python学习之路:MINST实战第一版
    Python学习之路:NumPy进阶
    Python学习之路:NumPy初识
    Python学习之路:一天搞定基础部分
    7. 整数反转(leetcode)
    1. 两数之和(leetcode)
    172. 阶乘后的零(leetcode)
    Java模拟斗地主发牌(Collections工具类的应用)
    CF刷题-Codeforces Round #481-G. Petya's Exams
    【android】安卓平台版本和API版本的对应关系
  • 原文地址:https://www.cnblogs.com/acgoto/p/9542182.html
Copyright © 2011-2022 走看看