搜索资源列表
CoinUtils-2.2.5
- The CoinUtils project is a collection of open-source utilities developed and used by a variety of other projects in the COIN-OR repository. The project includes classes for storing and manipulating sparse matrices and vectors, performing matrix facto
siliver-coin
- 银币问题，属于算法设计与分析，语言c++在n个银币中有一个是不合格的，不合格的银币比合格银币要轻。 现用天平秤银币，找出不合格的银币，且在最坏情况下秤银币的次数最少。 -Silver question, are algorithm design and analysis, language c++ in n silver is in a failed, the failure of silver coins than qualified to be light. Balance scal
Decfunction
- 算法分析实验 算法分析减治法 8枚硬币问题-Experimental analysis of algorithms analysis of algorithms by-conquer eight coin problem
Frequency-picture-of-throwing-a-coin
- 问题的提出：编程模拟抛硬币所得正面的频率图。假设每次抛10次为一事件，记录每次得到正面的次数，共抛掷100000次，计算得到正面次数的概率发布，并绘图输出结果。 思路：数值概率算法常用于数值问题的求解，此类算法所得的往往是近似解，且近似解的精度随计算时间的增加而不断提高，得到一定精度近似解就可以满足问题要求。-Of the problem: a coin flip from positive programming analog frequency map. Assuming throw 1
4.3
- 硬币找钱问题的解决方案，时间复杂度小，方法十分方便-Coin find money solution to the problem
At-least-the-issue-of-coins
- 有n种不同面值的硬币，各硬币面值存于数组T[1:n] 现用这些面值的钱来找钱；各面值的个数存在数组Coins[1:n]中。 对于给定的1<=n<=10，硬币面值数组、各面值的个数及钱数m，0<=m<=2001，编程计算找钱m的最少硬币数。 -There are n different denominations of coins, each coin denomination stored in the array T [1: n] current face v
last
- 设有n 种不同面值的硬币，各硬币的面值存于数组T［1:n ］中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins［1:n ］中。对任意钱数0≤m≤20001，设计一个用最少硬币找钱m 的方法。-N has a different denomination coins, the coins stored in the array T [1: n ). Is to use these coins to change. Can use a variety of coins a
guinan
- 有N个硬币（N为偶数）正面朝上排成一排，每次将N-1个硬币翻过来放在原位置，不断地重复上述过程，直到最后全部硬币翻成反面朝上为止。设计程序让计算机把翻币的最简过程以及翻币次数输出（用*表示正面，O表示反面） 2、有N个硬币（N为奇数）正面朝上排成一排，每次将N-2个硬币翻过来放在原位置，不断地重复上述过程，直到最后全部硬币翻成反面朝上为止。可以让计算机把翻币的最简过程以及翻币次数输出（用*表示正面，O表示反面） -There are N coins (even) face up in a
CoinChange
- 硬币找零算法（动态规划）：有一堆不同面值的硬币，需要找到一个硬币数最少的组合来组成某一个数值。-Coin change algorithm (dynamic programming): There are a bunch of different denominations of coins, need to find a combination of the number of coins to form at least one value.
den
- denominate Min-Coin Change Min-Coin Change is the problem of using the minimum number of coins to make change for a particular amount of cents, n, using a given set of denominations d_1 \ldots d_m. This is closely related to the Coin Change pr
coinchange
- Coin Change problem solved in c. One of the fundamental problems in dynamic programming
Moedas
- Coin counting algorithm in java
coin
- 计算n元钱硬币有多少种表达方式。例如，对于1元，可以使用1元钱完成，也可以使用两个5角完成。可用于三种不同货币，每种货币提供不同面额。编写程序计算出每一种组合方式。(How many expressions are there to calculate n dollar coins? For example, for 1 yuan, 1 yuan can be used and two 5 corners can be used. It can be used in three differen