There are 1 stations numbered from 0 to . from each station ,
some load has to be transferred to another station by train . the fuel
consumption of train between 2 successive station is 1 litre .
Find the minimum amount of fuel , in which loads can be transferred to
all the destination sta
On Tue, Nov 8, 2011 at 1:43 AM, Vishnutej wrote:
> tourism is planning to construct a park and install water fountains. It is
> planning to organize "Musical Fountain" shows. The fountains shoot water in
> air in varying directions and with varying heights. Fountains are to be
> installed in a row
tourism is planning to construct a park and install water fountains. It is
planning to organize "Musical Fountain" shows. The fountains shoot water in
air in varying directions and with varying heights. Fountains are to be
installed in a row such that water from all the fountains is visible.
Y
Hey .. here is a problem I saw somewhere on net. Can anyone give me
some ideas on its algo ?
There is a tray that contains a row of "s" slots where biscuits may be
placed. You can have atmost one biscuit per slot. You and your friend
play a game with it. Each of you get to pick biscuits in turns.
