Description: 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
To Search:
File list (Check if you may need any files):
greedy algorithm
................\贪 婪 问 题.doc
................\贪婪的送礼者.cpp
Download