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): 6587    Accepted Submission(s): 4449


    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 #include<stdio.h>
     2 int c1[1000];
     3 int c2[1000];
     4 int main()
     5 {
     6      int n,i,j,k,t;
     7      while(scanf("%d",&n)!=EOF&&n)
     8      {
     9           for(i=0;i<n;i++)
    10           {
    11                c1[i]=0;
    12                c2[i]=1;
    13           }
    14           for(i=1;i<=n;i++)
    15           {
    16                for(j=0;j<=n;j++)
    17                {
    18                     for(k=0;k+j<=n;k+=i*i)
    19                      c2[k+j]+=c1[j];
    20                }
    21                for(t=0;t<=n;t++)
    22                {
    23                     c1[t]=c2[t];
    24                     c2[t]=0;
    25                }
    26           }
    27           printf("%d
    ",c1[n]+1);
    28      }
    29 
    30      return 0;
    31 }
    View Code
  • 相关阅读:
    vueJs+webpack单页面应用--vue-router配置
    webstorm IDE添加Plugins----添加vue插件
    WebStorm 11、PhpStorm 10免费激活(不需要注册码)
    webpack react基础配置二 热加载
    webpack react基础配置一
    移动端页面去掉click点击 背景色变化
    css美化checkbox radio样式
    ie11媒体查询以及其他hack
    angularJS ng-grid 配置
    网络7. TCP/IP网络之网络接口层
  • 原文地址:https://www.cnblogs.com/llei1573/p/3202441.html
Copyright © 2011-2022 走看看