程序为最小硬币问题（最少零钱问题）。设有n种不同面值的硬币，现要用这些面值的硬币来找开待凑钱数m，可以使用的各种面值的硬币个数不限。找出最少需要的硬币个数，并输出其币值。 -Procedures for the smallest coins (at least change problem). Has n different denominations of coins, is to use a coin to open these denominations came to be chip