Output of a C function
June 12, 2012
sorting 1 billion numbers
June 12, 2012

camel & banana puzzle

A Camel has to transport 3000 bananas from point A to point B, both 1000km apart. There are few constraints

  1. There is only one Camel.
  2. Camel can not carry more than 1000 bananas at one time.
  3. Camel eats one banana every kilometer when he travels.

What is the maximum number of bananas which can be transported from point-A to point-B.

Solution:

First of all, the brute-force approach does not work. if Camel start by picking up the 1000 bananas and try to reach point B, then Camel will eat up all the 1000 bananas on the way and there will be no banana left for the Camel to return to point A.

So we have to take an approach that Camel drop the bananas in between and then return to point A, to pick bananas again.

Since there are 3000 bananas and camel can only carry 1000 bananas, Camel will have to make 3 trips to carry them all to any point in between.

When bananas are reduced to 2000 then Camel can shift them to another point in 2 trips and when the number of bananas left are

In the first part, P1, to shift the bananas by 1Km Camel will have to

1. Move forward with 1000 bananas – Will eat up 1 banana in the way forward
2. Leave 998 banana after 1 km and return with 1 banana – will eat up 1 banana in the way back
3. Pick up the next 1000 bananas and move forward – Will eat up 1 banana in the way forward
4. Leave 998 banana after 1 km and return with 1 banana - will eat up 1 banana in the way back
5. Will carry the last 1000 bananas from point a and move forward – will eat up 1 banana

Note: After point 5 the camel does not need to return to point A again.

So to shift 3000 bananas by 1km Camel will eat up 5 bananas.

After moving to 200 km the camel would have eaten up 1000 bananas and is now left with 2000 bananas.

Hence, the length of part P1 is 200 Km.

Now in the Part P2, the Camel need to do the following to shift the Bananas by 1km.

1. Move forward with 1000 bananas - Will eat up 1 banana in the way forward
2. Leave 998 banana after 1 km and return with 1 banana - will eat up this 1 banana in the way back
3. Pick up the next 1000 bananas and move forward - Will eat up 1 banana in the way forward

Note: After point 3 the camel does not need to return to the starting point of P2.

So to shift 2000 bananas by 1km Camel will eat up 3 bananas.

After moving to 333 km the camel would have eaten up 1000 bananas and is now left with the last 1000 bananas.

The camel will actually be able to cover 333.33 km,
I have ignored the decimal part because it will not make a difference in this example.

Hence the length of part P2 is 333 Km.

Now, for the last part, P3, the Camel only has to move forward. He has already covered 533 (200+333) out of 1000 km in Parts P1 & P2. Now he has to cover only 466 km and he has 1000 bananas.

He will eat up 466 bananas on the way forward, and at point B the Camel will be left with only 533 Bananas.

3 Comments

  1. Gaurav Sharma says:

    Magnificent solution!!

  2. Vivek Sharma says:

    Easy to comprehend….thank u sir

  3. shipra says:

    Hey it will be 467 km left after 533 km out of 1000.

Leave a Reply

Your email address will not be published. Required fields are marked *