1. In accordance with interface prompted yes or no 2. After the end of each set will be printed in your heart Guess two numbers and calculate the number of turns when the time spent 3. Continuous between each set The program uses the algorithm strategy divide-and-conquer algorithm 1. First minimizing the area, the priority program for the first of a solution obtained from small areas 2. As far as possible in order to obtain a power of 2 range to split the number to find a number, the average will be the best way is dichotomy. So what is the minimum number of steps to find the first solution? If the search scope My approach is to first find the minimum number of steps to a solution, then using the left to find a solution dichotomy. Dichotomy can be widely used to make, and I will all the problems are basically the scope of 4 as the starting small unit, is the first question the reasons for selection 5 and 16. Around after the answer is yes, then I will keep the scope of the

DivideAndConquer_Algo.cpp

• 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．