文件名称:greedy-algorithm
介绍说明－－下载内容均来自于网络，请自行研究使用
贪婪算法从文件输入一个高精度正整数N，去掉其中任意S个数后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S，寻找一种方案使得剩下的数字组成最小的新数。
输出得到的新正整数
-greedy algorithmEnter a high precision the file is an integer N, remove any of the number of S after the number of the left and right in order to form a new positive integer. Programming for a given N and S, looking for a solution that makes the number of the remaining number of the smallest number of new.
The new integer output
输出得到的新正整数
-greedy algorithmEnter a high precision the file is an integer N, remove any of the number of S after the number of the left and right in order to form a new positive integer. Programming for a given N and S, looking for a solution that makes the number of the remaining number of the smallest number of new.
The new integer output
(系统自动生成,下载前可以参看下载内容)
下载文件列表
greedy algorithm
................\贪 婪 问 题.doc
................\贪婪的送礼者.cpp