用贪心算法解题: 设n是一个正整数。现在要求将n分解为若干互不相同的自然数的和，且使这些自然数 的乘积最大。-Greedy algorithm with problem-solving: Let n be a positive integer. N decomposition will now require a number of separate and natural number, and make them the product of the largest natural nu

利用会贪心算法求解超市系统的找零钱问题。-liyongtanxinsuanfashixianchaoshixitongdezhaolingqianwenti。

马踏棋盘贪心算法，时间复杂度小，效率高,-Horse riding chessboard greedy algorithm, the time complexity, high efficiency,