|
||||||||||
Guess GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 871 Accepted Submission(s): 501 Problem Description Bob plays the "guess the number right" with Alice recently,the game's rule is that Alice give Bob a upper limit number N ,then he write any of a number on paper which Bob can't know what it is and the number must be between 1 and N.Bob has many chances to guess the number and every time when Bob guesses Alice will tell him if his is bigger than the correct number or small than the correct number until he is right. Now the Bob wanted to use binary search method to guess the right number, because he knows this method is quite fast to find the right number. Input We test the problem in many cases.Each case begin with one integers N( 1<= N <= 100000 ). Output Output the expected number of chances required to guess the number right, which accurate to 2 fractional digits. Sample Input
Sample Output
Author erriyue Source | ||||||||||
|