zoukankan      html  css  js  c++  java
  • uva674

    题目大意是用 1,5,10,25,50 五种钱组成一个给定的N ,求有多少种组发。。

    dp[i]为 价值I 的个数, 那么dp[i] += dp[i-k]  (k为上面五种钱币 。。 )

    题目:

    Coin Change 

    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, two 5-cent coins and one 1-cent coin, 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 7489 cents.

    Input 

    The input file contains any number of lines, each one consisting of a number 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
    

    代码:

     1 #include <iostream>
     2 #include <memory.h>
     3 using namespace std;
     4 
     5 int dp[10000];
     6 int M[5] = {50,25,10,5,1};
     7 int main()
     8 {
     9     int total;
    10     while(cin>>total)
    11     {
    12         if(total ==0){ cout<<"0"<<endl;continue;}
    13 
    14         dp[0]=1;
    15             for(int j = 0;j<=total;j++)
    16             {
    17                 for(int i=0;i<5;i++)
    18                 {
    19                     dp[j+M[i]] += dp[j];
    20                 }
    21         }
    22         cout<<dp[total]<<endl;
    23         memset(dp,0,sizeof(dp));
    24     }
    25 
    26 
    27     return 0;
    28 }

    代码2

     1 #include <iostream>
     2 #include <memory.h>
     3 using namespace std;
     4 
     5 int dp[10000][6];
     6 int M[5] = {1,5,10,25,50};
     7 int main()
     8 {
     9     int total;
    10 
    11 
    12         dp[0][0]=1;
    13 
    14         for(int i=1;i<=8000;i++)
    15         {
    16             for(int j=0;j<5;j++)
    17             {
    18                 for(int k=0;k<=j;k++)    //一开始这里写错了 k 必须小于j 否则会出现多加的情况
    19                 {
    20                     if( i<M[j]  )break;
    21                     dp[i][j] += dp[i-M[j]][k];
    22                 }
    23             }
    24         }
    25 
    26     while(cin>>total)
    27     {
    28         if(total ==0){ cout<<"0"<<endl;continue;}
    29 
    30         int ans=0;
    31         for(int i=0;i<5;i++)
    32         {
    33             ans+=dp[total][i];
    34         }
    35         cout<<ans<<endl;
    36 
    37     }
    38 
    39 
    40     return 0;
    41 }
  • 相关阅读:
    unix/linux中图形界面那些事
    vmware虚拟机工具vmware tools介绍及安装排错
    debian软件源source.list文件格式说明
    Python 基础学习 总结篇
    Git 学习(八)其他
    Git 学习(七)标签管理
    Git 学习(六)分支管理
    Git 学习(五)远程仓库
    Git 学习(四)操作修改和版本穿梭
    页面元素定位 XPath 简介
  • 原文地址:https://www.cnblogs.com/doubleshik/p/3495667.html
Copyright © 2011-2022 走看看