Computer Forums - View Single Post

mdhakk · 03-18-2005, 06:11 PM

I would assume the best way would be to start dropping one ball from n, the other ball from n-(n-1), and run a counter that subtracts a floor from the first ball and moves the second ball to n-(n-2) ...etc. When the condition for one of the ball changes from broken=true to broken=false or vice versa, you would know which floor is the right floor.

03-18-2005, 06:11 PM	#2 (permalink)
mdhakk Newb Techie Join Date: Mar 2005 Posts: 9	I would assume the best way would be to start dropping one ball from n, the other ball from n-(n-1), and run a counter that subtracts a floor from the first ball and moves the second ball to n-(n-2) ...etc. When the condition for one of the ball changes from broken=true to broken=false or vice versa, you would know which floor is the right floor.