zoukankan      html  css  js  c++  java
  • hdu1398

                                   Square Coins

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


    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
     
     
    #include<iostream>
    using namespace std;
    int main()
    {
        int n,i,j,k,c1[10000],c2[10000];
        while(scanf("%d",&n)!=EOF && n)
        {
            for(i=0;i<=n;i++)
            {
                c1[i] = 1;
                c2[i] = 0;
            }
            for(i=2;i<=n;i++)
            {
                for(j=0;j<=n;j++)
                {
                    for(k=0;k+j<=n;k+=i*i)
                    {
                        c2[j+k] += c1[j];
                    }
                    
                }
                for(j=0;j<=n;j++)
                {
                    c1[j] = c2[j];
                    c2[j] = 0;
                }
            }
            printf("%d
    ",c1[n]);
        }
        return 0;
    }
  • 相关阅读:
    python 调用dll 动态链接库 结构体参数及回调函数等示例
    逆向x64-small-trick
    Malloc碎碎念
    关于OF和CF
    月赛-Crackhash
    ARM64调试环境
    Apache Kafka(六)- High Throughput Producer
    Apache Kafka(五)- Safe Kafka Producer
    Apache Kafka(四)- 使用 Java 访问 Kafka
    Apache Kafka(三)- Kakfa CLI 使用
  • 原文地址:https://www.cnblogs.com/Deng1185246160/p/3242485.html
Copyright © 2011-2022 走看看