搜索资源列表
ChangeBack
- C++动态规划的算法例子,找零钱的经典问题编程
money
- 自己写的找零钱问题 编写程序 ,首先由用户输入确定金钱面额的总类N,然后分别输入这N种金钱的面额值,最后输入找回零钱的总数,由程序计算结果 显示需要各面额值的最少张数。-Write their own programming to find the issue of change, first of all by the user input to determine the general category of money denominated in N, and then enter
1
- 找零钱问题,一直都很受关注,希望大家好好学习-look money,it is very important,hope everybody good good study ,day day up!
suanfa
- 里面包含了各种常用算法的java实现,如八皇后问题,合唱队问题,找零钱问题,最短路径问题等-Which contains a variety of commonly used algorithm java implementation, such as the eight queens problem, chorus problems, to find small change problem, the shortest path problem, etc.
zhaolingqian
- 本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
fan
- 问题描述: 球赛门票的售票处规定每位购票者限购一张门票,且每张门票售价50元。购票者中有 m位手持50元钱币,另有n人手持100元。假设售票处开始售票时无零钱。问这m+n人有 几种排队方式可使售票处不致出现找不出钱的局面。 编程任务: 对给定的m,n(0<=m,n<=11),输出各种排队方式(从小到大),计算出排队方式总数。 -Problem Descr iption: The box office ticket sales are limited to th
lingqian
- 简单的找零钱问题 属于算法中的程序 在c中运行-C++
minimum-changes(dynamic-program)
- 最少零钱问题,找零钱问题,动态规划经典算法-the question of minimun changes for a given money,dynamic programming
Dynamic_Programming
- 利用动态规划来完成找零钱问题 计一个动态规划算法如何解决找零问题,对1≤j≤L,计算出所有的C( n,j )。算法中只允许实用一个长度为L的数组。找出用钱的最小个数。 (2) 0<=k<=j i>=1 i<=n,maxint c(i,k)硬币枚数 -Dynamic programming problems to complete the count to keep the change a dynamic programming algorithm to so
Back_money
- 贪心算法,找零钱问题 币种有100元、50元、10元、5元、1元、0.5元和0.1元-The greedy algorithm, the change of currency 100 yuan, 50 yuan, 10 yuan, 5 yuan, 1 yuan, 0.5 yuan and 0.1 yuan
coin
- 程序为最小硬币问题(最少零钱问题)。设有n种不同面值的硬币,现要用这些面值的硬币来找开待凑钱数m,可以使用的各种面值的硬币个数不限。找出最少需要的硬币个数,并输出其币值。 -Procedures for the smallest coins (at least change problem). Has n different denominations of coins, is to use a coin to open these denominations came to be chip
Dynamic-planning-for-change
- 动态规划应用 动态规划方法解决找零钱问题-Dynamic programming method to solve the problem of looking for change
yeqgs
- C++动态规划的算法例子,找零钱的经典问题编程()
740560
- C++动态规划的算法例子,找零钱的经典问题编程()
贪心算法-找零问题
- 假设零钱系统的币值是{1,p,p^2,……,p^n},p>1,且每个钱币的重量都等于1,设计一个最坏情况下时间复杂度最低的算法,使得对任何钱数y,该算法得到的零钱个数最少,说明算法的主要设计思想,证明它的正确性,并给出最坏情况下的时间复杂度。