Introduction - If you have any usage issues, please Google them yourself
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)