zoukankan      html  css  js  c++  java
  • hdu 1398 Square Coins (母函数)

    Square Coins

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


    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
     
    Recommend
    Ignatius.L   |   We have carefully selected several similar problems for you:  2152 2082 2079 2069 2110 
     

    母函数入门题

     1 //0MS    200K    615 B    G++    
     2 #include<stdio.h>
     3 #define N 305
     4 int c1[N],c2[N];
     5 int _n[18]={1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289};
     6 int fun(int n)
     7 {
     8     int i,j,k;
     9     for(i=0;i<=n;i++){
    10         c1[i]=1;
    11         c2[i]=0;
    12     }
    13     for(i=1;i<17;i++){
    14         for(j=0;j<=n;j++)
    15             for(k=0;k+j<=n;k+=_n[i])
    16                 c2[j+k]+=c1[j];
    17         for(j=0;j<=n;j++){
    18            c1[j]=c2[j];
    19            c2[j]=0; 
    20         }
    21     }
    22     return c1[n];
    23 }
    24 int main(void)
    25 {
    26     int n;
    27     while(scanf("%d",&n)!=EOF)
    28     {
    29         if(n==0) break;
    30         printf("%d
    ",fun(n));
    31     } 
    32     return 0;
    33 }
  • 相关阅读:
    Elasticsearch核心技术与实战-学习笔记
    在ABP中灵活使用AutoMapper
    使用log4net记录ABP日志
    Abp小知识-如何全局设置DontWrapResult属性
    《C#并发编程经典实例》学习笔记—2.7 避免上下文延续
    NEST 6.X升级到7.X
    django框架——十
    django——自定义分页
    django框架九
    orm数据库查询优化和数据库三大设计范式
  • 原文地址:https://www.cnblogs.com/GO-NO-1/p/3819730.html
Copyright © 2011-2022 走看看