Introduction - If you have any usage issues, please Google them yourself
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
Packet : 3971000deletenumber.rar filelist
input.txt
DeleteNumber.cpp