total bananas=3000 ...max capacity=1000 ==>3 trips needed to transport all
for traveling 1 km 1st trip 998[eats 1 banana while coming and 1 banana while going back] 2nd trip 998 3rd trip 999[no need to go back] ==>5 banana for travelling 1 km since 3 trips involved v spend 5 banana per km v need to reduce it to 2 trips ==>the point where total banana becomes 2000 ==>3000-2000=1000 ==>1000/5=200 km at 200 km v hav 2000 bananas now for travelling 1 km 1st trip 998 2nd trip 999 ==>3 banana for travellin 1 km find the point where this becomes single trip dat is total banana becomes 1000 ==>2000-1000=1000 ==>1000/3=333.3km v hav reached 533.33 km with 1000 banana now make a single trip of remaining 466.66 to city B v reach city B with 533.3 banana dats the answer 533 1/3 banana On Dec 14, 5:47 pm, divya <[email protected]> wrote: > There is a desert of 1000kms long. A camel is there and 3000 bananas. > At one go a camel can take 1000 bananas. For each one km to walk camel > eats 1 banana. How many bananas can we cross to the other side of > desert -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
