Description: Cut a few problems, given n-bit positive integer a, removed one of arbitrary k-figures, the remaining number of the original order to form a new positive integer. For a given n a positive integer a and positive integer k, to design an algorithm to find the rest of the composition of the new figures smallest cut the number of programs
- [cover] - closed interval coverage is used to achi
- [subset] - Schomburg algorithm used to solve the pr
- [tsp] - TSP's intelligent algorithm, which conta
- [sche3] - Description of laquo: Suppose you want t
- [3] - Given an n-bit positive integer a, remov
- [shizihebing] - This is a problem on the stones combined
- [yi] - This is my compilation of the experiment
- [deldata] - Cut the number of keyboard input of a hi
- [rent] - Yacht rental issues in the Yangtze River
File list (Check if you may need any files):
Download