键盘输入一个高精度的正整数N（此整数中没有‘0’），去掉其中任意S个数字后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S，寻找一种方案使得剩下的数字组成的新数最小。 输出应包括所去掉的数字的位置和组成的新的正整数。（N不超过240位） -Keyboard to enter a high-precision integer N (this is not an integer ' 0 ' ), which removed any remaining S-digit numbers after the original order will be formed around a new positive integer. Programming of a given N and S, such that the rest of the program to find a new minimum number of digits. The output should be removed, including the location and the number of new positive integers. (N not more than 240)