zoukankan      html  css  js  c++  java
  • Square Coins[HDU1398]

    Square Coins

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

    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
    Asia 1999, Kyoto (Japan)
     

     

    Recommend
    Ignatius.L

    #include<stdio.h>
    #include<string.h>
    int p[800],tmp[800];
    void prepare()
    {
        int i,j,k;
        for (i=0;i<=300;i++) p[i]=1;
        for (i=2;i<=17;i++)
        {
            memset(tmp,0,sizeof(tmp));
            for (j=0;j<=300;j++)
                for (k=0;k<=300;k+=i*i)
                    tmp[j+k]+=p[j];
            for (j=0;j<=300;j++) p[j]=tmp[j];
        }
    }
    int main()
    {
        prepare();
        int n;
        while (scanf("%d",&n)!=EOF)
        {
            if (n==0) return 0;
            printf("%d
    ",p[n]);
        }
        return 0;
    }

      

     

  • 相关阅读:
    Perl的Open函数
    较详细的介绍JNI
    Java多线程单元测试
    sleep函数的简单原理
    Struts与Servlet的冲突
    Ant学习记录
    JDK转码工具
    Throwable
    Entity Framework系列文章导航
    多核时代 .NET Framework 4 中的并行编程1概述
  • 原文地址:https://www.cnblogs.com/dramstadt/p/3245342.html
Copyright © 2011-2022 走看看