Description: Given n-bit positive integer a, to remove any of them k ≤ n digits after the original order of the remaining figures to form a new positive integer. For a given n-bit positive integers a and positive integer k, design an algorithm to find the remaining digits of the number of the smallest deletion the number of new programs. For a given positive integer a, calculated by deleting the k-programmed to be the minimum number of figures.
To Search:
File list (Check if you may need any files):
1.txt
Download