回复：很好的分析

Follow your suggestion, at each stage, we can assume that there are m numbers get 0 strike, n numbers get 1 strike (2 strike out). Let f(m,n) be the least number of questions needed for all the m+n numbers been striked out.
f(m,n) = 1+min_{(i,j)}max{f(m-i,n+i-j),f(i,j+m-i)}
where i=0,..., m; j = 0,...,n
f(0,0) = 0
If we can find the optimal (i,j) at each step, we get the solution.
Any simple way to solve the problem other than using computer?

所有跟帖： 

• for N=100, 10 questions to ask -HF:- ♀ (834 bytes) () 06/12/2008 postreply 20:13:24

• I think that there is a mistake at the eighth guess -ettubrute- ♂ (284 bytes) () 06/12/2008 postreply 20:36:40