Description: A child bought a value of less than $ 1 sugar, and $ 1 of money to the salesman. Salesman hoping to find the children with the minimum number of coins. Suppose provides unlimited number of denominations of 25 cents, 10 cents, 5 cents, and 1 cent coins. Salesman looking for change step by step composed number, a coin each addition. Greedy guidelines when selecting coins used as follows: every choice should be made as large as possible number of coins. In order to ensure the feasibility of solution (ie: given the number of coins are looking for coins equal), the selected coins should not exceed the total number of coins needed for the final.
To Search:
File list (Check if you may need any files):
lingqian\Debug\lingqian.exe
........\.....\lingqian.ilk
........\.....\lingqian.obj
........\.....\lingqian.pch
........\.....\lingqian.pdb
........\.....\vc60.idb
........\.....\vc60.pdb
........\lingqian.cpp
........\lingqian.dsp
........\lingqian.dsw
........\lingqian.ncb
........\lingqian.opt
........\lingqian.plg
........\Debug
lingqian
Download