Description: Keyboard input of a high-precision positive integer s (< = 240 bit), remove any remaining k-digit number after the original order will be formed around a new positive integer. Programming on a given s and k, find a program that remaining was the smallest. Input: s k output: The last remaining minimum number of sample input () 1785434 (13) Sample input
To Search:
File list (Check if you may need any files):
删数问题\1删数问题.doc
........\sswt.pas
Download