Description: Coins give change problem
Has six different denominations of coins in denominations of coins were 5 minutes, 10 cents, 20 cents, 50 cents, 1 yuan and 2 yuan. Now we use these coin denominations to shop and find the money. When shopping the number of coins of various denominations that can be used is stored in an array of Coins [1: 6], it is assumed for each denomination of coin store more than enough. For a given payment amount, calculated using the minimum number of coins trading scheme. Enter the data for each row has six integer and a real number two decimal places, respectively, the number of coins of various denominations that can be used and payment amount. The output is the minimum number of coins needed exchanges, if it is impossible to complete the transaction, the output impossible .
To Search:
File list (Check if you may need any files):
coin
....\coin.cpp
....\coin.dsp
....\coin.dsw
....\coin.ncb
....\coin.opt
....\coin.plg
....\Debug
....\.....\coin.exe
....\.....\coin.ilk
....\.....\coin.obj
....\.....\coin.pch
....\.....\coin.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
Download