zoukankan      html  css  js  c++  java
  • UVA674——DP(找钱1)—— Coin Change

    Description

    Download as PDF
     

    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
    

     大意:给你n块钱,让你分成1.5.10.25.50零钱,问有多少种方法,记忆化搜索

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int dp[7500][5];
    int v[5] = {1,5,10,25,50};
    int DP(int i,int j)
    {
        if(j == 0)
            return dp[i][j] = 1;
        if(dp[i][j] != -1)
            return dp[i][j];
        dp[i][j] = 0;
        for(int k = 0 ;i - k*v[j] >= 0; k++)
            dp[i][j] += DP(i-k*v[j],j-1);
        return dp[i][j];
    }
    int main()
    {
        memset(dp,-1,sizeof(dp));
        int n;
        while(~scanf("%d",&n)){
            for(int i = 0 ; i <= n ; i++)
                dp[i][0] = 1;
            printf("%d
    ",DP(n,4));
        }
        return 0;
    }
    View Code

    如果上面的不行要把dp[i][j]清为0

  • 相关阅读:
    洛谷P4175 网络管理
    洛谷P2605 基站选址
    洛谷P3723 礼物
    bzoj3771 Triple
    洛谷P3321 序列统计
    bzoj2194 快速傅里叶之二
    1109课堂内容整理
    响应式网页
    表单隐藏域有什么作用?
    1106课堂笔记
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4463986.html
Copyright © 2011-2022 走看看