搜索资源列表
分硬币的简单程序
- 可实现硬币的分法，一分，二分，五分硬币。内附有for循环版-achieve coins points, one points, two points, five coins. Enclosing a version for recycling
Coins
- 现在有八枚银币abcdefg，已知其中一枚是假币，其重量不同于真币，但不知道是轻还是重，如何用天平以最小的比较次数决定出那个是假币，并得知假币是比真币轻还是重。 -There are eight coins abcdefg, known to one of them is counterfeit money, and its weight is different from the real coins, but I do not kn
COIN
- 一、问题叙述: 一摞硬币共m枚，每枚硬币均正面朝上。取最上面的1枚，将它们翻面后放回原处，然后取最上面的2枚硬币，将它们一起翻面后再放回原处。再取3枚，取4枚，…，直至整摞硬币都按上述方法处理过。接下来再从这摞硬币最上面的1枚开始，重复刚才的做法。这样一直下去，直到这摞硬币中的每一个又都是正面朝上为止。问这种情况是否一定出现？如果出现，则一共需做多少次翻面？-1, describes the problem: one pile a
WORD
- I = imread( C:\MATLAB701\toolbox\images\imdemos\coins.png ) imshow(I) figure, imhist(I,64)
coins
- How do you choose the coins in your pocket to pay something? Is there an algorithm to use the max numbers of coins? Of course there is as shown in the book "L algoritmo del parcheggio" (the parking algorithm) by Prof
coins
- 计算硬币数量 运用imerode and bwlabel 代码-Calculate coins number using imerode code and bwlabel
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
coins-change.cpp
- This code takes cents as input, and converts them to change coins.
turn-coins
- 有N个硬币（N为偶数）正面朝上排成一排，每次将N-1个硬币翻过来放在原位置，不断地重复上述过程，直到最后全部硬币翻成反面朝上为止。设计程序让计算机把翻币的最简过程以及翻币次数输出（用*表示正面，O表示反面）-turn coins
Coins
- My solution using Dynamic Programming of the Coins Problem.
Detecting-Coins
- 用直线检测和边缘检测来检测圆，用硬币来实验-Detecting Coins using Hough Tramsform
matlab_10-coins
- matlab图像处理的，检测10个硬币的位置-matlab image processing to detect the position of the 10 coins
picking-up-coins
- 自己写的很好玩的小游戏，捡从天而降的金币。对练习MFC编程很有帮助-Himself wrote a very fun little game, picking up coins from heaven. MFC programming on the exercise helpful
coins
- define and calculate coins with matlab
coins
- shell scr ipt to represent any amount of money by using the fewest number of coins The scr ipt take one argument that is amount of money
COINS
- 12硬币问题，能够输入硬币数和称重次数，有简要注释-12 coin problem, can enter the number of coins and weighing, a brief comment
Choosing-Coins-To-Match-a-Given-Value
- The change making problem is given a target value C and a set of N coin denominations with value W. The task is to determine the minimum number of coins needed to form the given value. In the unbounded change making
coins-detection
- 使用霍夫变换检测硬币，个人感觉效果还行，适用于一元，五角，一角的-Use Hough transform to detect coins
Calculate-the-number-of-coins
- 美国的货币单位为美元（Dollar），1美元等于100美分。纸币面额最小为1美元，1美元以下用硬币，硬币有25美分（Quarter）、10美分（Dime，一角）、5美分（Nickel）、1美分（Cent 或 penny）。 下面的程序要求输入你收藏的 1美分( penny)、5美分(Nickel)、10美分(Dime)、25美分(Quarter)的硬币的数量，然后对他们进行计算。 -Calculate the number o
collect-coins
- 用pygame写的简单的二人游戏，收集金币比赛。-Use pygame to write a simple two-player game to collect gold coins.