Description: Given n-bit positive integer a, which removed any k ≤ n digits, the remaining number of the original order to form a new positive integer. For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few. For a given positive integer a, calculated by deleting the k-digit number after the minimum.
To Search:
- [soldier] - In a grid divided into the playground, n
File list (Check if you may need any files):
删数问题
........\1060.cpp
........\删数问题.doc
Download