一个使用贪婪算法解决机器人收集硬币问题的小练习。-use a greedy algorithm to solve the problem robot coin collection of small practice.

设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。对任意钱数0≤m≤20001，设计一个用最少硬币找钱m的方法。-With n different coins, the face value of the coins stored in the array T [1: n] in the. Now use these coins to find the money. You can use the

This package contains an implementation of the Infinite Kernel Learning (IKL) algorithm and the SimpleMKL algorithm. This is realized by building on Coin-Ipopt-3.3.5 and Libsvm.

12硬币问题，能够输入硬币数和称重次数，有简要注释-12 coin problem, can enter the number of coins and weighing, a brief comment