zoukankan      html  css  js  c++  java
  • 7.3.3 Square Coins

    Square Coins

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

    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+x+x^2+x^3+..x^n)*(1+x^4+x^8+..+x^)*(1+x^9+x^18+x^27+..+)*(...)

     1 #include <cmath>
     2 #include <cstdio>
     3 #include <algorithm>
     4 #include <cstring>
     5 #include <string>
     6 #include <cstdlib>
     7 using namespace std;
     8 
     9 const int maxn=310;
    10 int n,b[20],a[maxn];
    11 int c1[maxn],c2[maxn];
    12 
    13 void close()
    14 {
    15 exit(0);
    16 }
    17 
    18 
    19 void init()
    20 {
    21     for (int i=1;i<=17;i++)
    22         b[i]=i*i;
    23     while (scanf("%d",&n)!=EOF)
    24     {
    25         if (n==0) close();
    26         memset(c1,0,sizeof(c1));
    27         memset(c2,0,sizeof(c2));
    28         for (int i=0;i<=n;i++)
    29             c1[i]=1;
    30         for (int i=2;i<=17;i++)
    31         {
    32             if (b[i]>n) break;
    33             for (int j=0;j<=n;j++)
    34             {
    35                 if (c1[j]==0) continue;
    36                 for (int k=0;j+k<=n;k+=b[i])
    37                 {
    38                     c2[j+k]+=c1[j];
    39                 }
    40             }
    41             for (int j=0;j<=n;j++)
    42                 c1[j]=c2[j],c2[j]=0;
    43         }
    44         printf("%d
    ",c1[n]);
    45     }
    46 }
    47 
    48 int main ()
    49 {
    50     init();
    51     close();
    52     return 0;
    53 }
  • 相关阅读:
    linux 重新设置mysql密码
    php 一些个 常用 函数
    nginx php错误日志开启
    linux crontab 定时执行任务(php)
    聚合短信接口-- php
    Commons Collections1分析
    spring之 注解ioc&依赖注入 & spring整合mybatis
    Spring之 IOC&依赖注入
    java之 Mybatis(二)
    java之 MyBatis(一)
  • 原文地址:https://www.cnblogs.com/cssystem/p/3212389.html
Copyright © 2011-2022 走看看