Description: Description of the problem: given n-bit positive integer a, which removed the arbitrary k-figures, the remaining figures as originally arranged in the order of a new positive integer. Algorithm design: a given n (1 <= n <= 200)-bit positive integers a and k, at this time, k is less than n. Try to design an algorithm to find k by deleting the number, the remaining digits of the new cut the number of the smallest programs.
To Search:
File list (Check if you may need any files):
deleted.txt
新建 文本文档 (2).txt
Download