The building

Logic Level pending

You have 2 bouncing balls and a mission.
You have told to find in which floor the bouncing ball will not bounce back (each floor above that floor gives the same result and the ball won't bounce back).

Find the least amount of times you need to check for finding the right floor without failing the mission. Assume the worst case in your answer (see examples)

If the ball didn't bounce back ,you lost him. If you lost the two balls before finding the floor you failed the mission.

Example :
I checked the first floor and it bounced back
and then the second floor and so on.
In this way the worst case will be checking 100 times.

BAD ANSWER!

Second example (dividing by 2) :
I checked the 50 floor. If the ball bounced back I need to check the above floors but if it didn't I need to check the lower floors.
In this way I can lose the second ball in the second try (50 floor didn't bounced back and 25 floor didn't bounced back).

FAILED THE MISSION!


The answer is 14.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Hasmik Garyaka
Dec 21, 2018

We check 14 floor, then 14+13 and so on. Minimal triangular number which is more than 100 is 14*15/2=105

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...