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

  • 相关阅读:
    一个C++程序员学习C#语言
    C#入门教程笔记
    完全卸载mysql 停止服务、卸载相关程序、删除注册表
    C++结构简介
    babun,windows shell
    无限极设计以及随意移动节点(树结构)
    springboot 配置访问外部静态资源详解
    mysql8+keepalived 双主高可用搭建
    mysql 双主复制搭建
    mysql 主备搭建
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4463986.html
Copyright © 2011-2022 走看看