Introduction - If you have any usage issues, please Google them yourself
Algorithm to achieve the title 3-1 at least coins Description: There are n kinds of different denominations of coins, the nominal value of each coin is stored in an array T [1: n]. Now use these nominal value of the coins came to money. The number of coins of various denominations that can be used is stored in an array of Coins is [1: n]. Any money 0 ≤ m ≤ 20 001, design a minimum of coins to give change m the method. Algorithm design: For a given 1 ≤ n ≤ 10 Coins come in denominations of array T and can use the various denominations of coins in the number of array Coins, as well as money m, 0 ≤ m ≤ 20 001, calculate the minimum number of coins to find the money m. Data Input: input data from the file input.txt, the first line of the file, given an integer value of n, since each line number in line 2, respectively, T [j] and Coins is [j]. The last line is looking for money m. The results of the output: calculate the minimum number of coins output to the file output.txt. Problem has no