zoukankan      html  css  js  c++  java
  • hdu 2069 Coin Change(完全背包)

    Coin Change

    Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 16592 Accepted Submission(s): 5656


    Problem Description
    Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.

    For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, or two 5-cent coins and one 1-cent coin, or one 5-cent coin and six 1-cent coins, or eleven 1-cent coins. So there are four ways of making changes for 11 cents with the above coins. Note that we count that there is one way of making change for zero cent.

    Write a program to find the total number of different ways of making changes for any amount of money in cents. Your program should be able to handle up to 100 coins.
     
    Input
    The input file contains any number of lines, each one consisting of a number ( ≤250 ) for the amount of money in cents.
     
    Output
    For each input line, output a line containing the number of different ways of making changes with the above 5 types of coins.
     
    Sample Input
    11
    26
     
    Sample Output
    4
    13
     
    Author
    Lily
     
    Source
     
    Recommend
    linle | We have carefully selected several similar problems for you: 1171 1398 1085 1028 2152
     
    第一次写完全背包的题,这题很简单,不过要注意硬币数目不能大于100
     
    题意:给你面值有1,5,10,25,50的币种,然后随意输入一个钱的数目,问用这些面值刚好凑成这个钱的方法有多少个(最多100个硬币)
     
    附上代码:
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 int dp[101][7500];
     6 int main()
     7 {
     8     int coin[5]= {1,5,10,25,50};
     9     int i,j,n,m,k;
    10     memset(dp,0,sizeof(dp));
    11     dp[0][0]=1;
    12     for(i=0; i<5; i++)   //用的硬币
    13     {
    14         for(k=1; k<=100; k++)  //硬币数目
    15         {
    16             for(j=coin[i]; j<=7500; j++)
    17             {
    18                 dp[k][j]+=dp[k-1][j-coin[i]];
    19             }
    20         }
    21 
    22     }
    23     while(~scanf("%d",&n))
    24     {
    25         int ans=0;
    26         for(i=0; i<=100; i++)
    27             ans+=dp[i][n];
    28         printf("%d
    ",ans);
    29     }
    30     return 0;
    31 }
  • 相关阅读:
    数组从文件中读取(接上问题)
    符合json格式要求的字符串转化为json字符串
    json-lib --->入门
    XStream-->别名;元素转属性;去除集合属性(剥皮);忽略不需要元素
    Ajax案例5-->省市联动
    Ajax案例4-->接收后台传递的XML数据
    Ajax案例3-->判断用户名是否被占用
    Ajax案例2-->POST请求
    Ajax案例1-->GET请求
    SecureCRT连接VMWare中的linux系统相关配置
  • 原文地址:https://www.cnblogs.com/pshw/p/5171223.html
Copyright © 2011-2022 走看看