Coin Exchange
Problem How can I exchange change for the smallest number of coins when several units of coins are given as follows? Each unit of coins can be used indefinitely. input In the first line, the number of types of coins N (1<=N<=12) is given. The second line is given N types of coins, and the next line…