问题描述：某国家的硬币体系包含N种面值（其中一定有面值为1的），现有一种商品价格为P,最少要用多少枚硬币可以买下-Problem Descr iption: A national system contains N kinds of coins with a face value (which must have a face value of 1), the current price of a commodity for P, at least take the number of coin

硬币识别器的制作全过程，包括了画板，编程，仿真及元件图-Coin recognition, making the whole process, including the drawing board, programming, simulation and component diagram

最少硬币问题，动态规划，算法设计与分析，研究生课程-Minimum coin problem, dynamic programming, algorithm design and analysis, postgraduate courses