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.

1.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．