实验一:

输入一个高精度的正整数N，去掉其中任意S个数字后剩下的数字按原左右次序组成一个新的正整数。写算法对给定的N和S，寻找一种方案使得剩下的数字组成的新数最小。



实验二:

编程解决带限期的单机作业排序问题。-Test one: Enter a positive integer precision N, to remove any of them left after the S numbers about the number of the original order of the formation of a new positive integer. Write algorithm for a given N and S, find a program makes the rest of the number of digits of the new minimum. Experiment II: Programming with the deadline to resolve the stand-alone job scheduling problem.