zoukankan      html  css  js  c++  java
  • hdu_1398_Square Coins_201404260953

    Square Coins

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


    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
     
     1 #include <stdio.h>
     2 int main()
     3 {
     4     int i,j,k,n;
     5     int c1[310],c2[310];
     6     while(scanf("%d",&n),n)
     7     {
     8         for(i=0;i<=n;i++)
     9         {
    10             c1[i]=1;
    11             c2[i]=0;
    12         }
    13         for(i=2;i<=n;i++)
    14         {
    15             for(j=0;j<=n;j++)
    16             for(k=0;k+j<=n;k+=i*i)
    17             {
    18                 c2[k+j]+=c1[j];
    19             }
    20             for(j=0;j<=n;j++)
    21             {
    22                 c1[j]=c2[j];
    23                 c2[j]=0;
    24             }
    25         }
    26         printf("%d
    ",c1[n]);
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    黑客书架上的书籍(转)
    vc 得到文件后缀名(转)
    配置IIS7(转)
    vs2008 目标框架 发布遇到的问题(转)
    CListCtrl用法(转)
    T400 折腾
    VS2008和.NET Framework3.5新功能(转)
    sql 2008 ctp 安装
    关于定位lsass内存中的明文密码(转)
    NT系统下木马进程的隐藏与检测(转)
  • 原文地址:https://www.cnblogs.com/xl1027515989/p/3691058.html
Copyright © 2011-2022 走看看