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
nice solution:)
On 14 December 2010 20:54, Prims topcode...@gmail.com wrote:
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]