Skip to main content

[PUZZLE] ELEPHANT AND BANANA PUZZLE

A merchant has bough some 3000 banana from market and want to bring them to his home which is 1000 km far from Market. He have a elephant which can carry maximum of 1000/- banana at time. That could have been easy but this elephant is very shrewd and he charges 1 banana for every one kilometer he travel.

Now we have to maximise number of banana which should reach to home.

Solution:

At present we are at 0th km with 3000 banana and elephant.
Lets see if elephant have to shift all the 3000 banana and elephant by 1 km.

For 1 km shift:

Take first 1000 banana and drop at 1st km. 2 banana consumed. One banana each for to and fro.
Second  1000 banana and drop at 1st km. 2 banana consumed.
Third 1000 banana and reach at 1st km. 1 banana consumed.

So all in all total 5 banana will be consumed if we shift a kilometer.

But that's not all, our total banana number are also reducing so we may have to reduce the number of turns too. And this will happen once we have reduced the banana by 1000 number. That means to reduce the count of banana by 1000 for first move we have to shift base to 200 km. See 5 banana for 1 km ratio i.e. 1000 banana / 5 = 200 km.

So we are now at 200th KMs with 2000 banana and elephant.

Post 200 km, for every 1 km shift in base;

Take first 1000 banana and drop at 1st km. 2 banana consumed. One banana each for to and fro.
Third 1000 banana and reach at 1st km. 1 banana consumed.

So all in all total 3 banana will be consumed if we shift a kilometer post 200 kms. 

Now the second phase will be to reduce the 1000 banana. So we can move to 1000/3 = 333.3 km maximum in this phase. 

So we will be moved to (200 + 333.3) 533.3  km base with 1000 banana.

Now onward we need only 1 banana for every km shift as elephant can carry all the 1000 banana and need not to come back. 
So out of 1000 banana, elephant will consume (1000 - 533.3) more banana to reach home.  

And total saved banana will be (1000 -(1000 -533.3)) = 533.3 banana. 

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

One way : Heap or Stack allocation

Took my time to find solution for this and it actually made me realize how much i have to learn. Now question is how can we enforce the creation of objects whether on heap or stack. Creating object on Heap only. Make your destructor private and create a destroy function. Class A {  ~A(){} public:  A(){} void destroy() { delete this; } } Now if you can not create your object: A a; // error: 'A::~A()' is private A  a = new A(); Great. Now all the objects will be allocated to heap only. Making destructor private a better choice than constructor as we don't know number of constructor so early in programming. Creating object on stack While i knew that it has to do something with operator new, but could not figure out how can i create object on stack and return the memory back to class initialization. Though answer was simple, i had to google for that: Overload operator new, new[], operator delete and delete[] and make them private ;) class A { pr...