Hi,
The above problem is Dyanamic Programming problem. The approach for
such type of problem is that
On May 4, 7:02 pm, techietone pritesh.kum...@gmail.com wrote:
There are 1 stations numbered from 0 to . from each station ,
some load has to be transferred to another station by train
Hi,
The above problem is Dyanamic Programming problem. The approach for
such type of problem is that
- try to solve the problem for the smallest instance
- solve the problem for some more smaller instance
- establish the recurrence to solve the problem.
- use tables to store the
how will u formulate the dp solution , as i was pointed by somebody that
its a linear programming problem . (simplex).
Not sure though.
On Fri, May 4, 2012 at 7:50 PM, rs ravishanker@gmail.com wrote:
Hi,
The above problem is Dyanamic Programming problem. The approach for
such type of
ye when it comes to maximizing or minimizing an equation the LPP is
enough, when it
comes to optimizing the solution the DP comes into the picture.
On May 4, 7:24 pm, pritesh kumar pritesh.kum...@gmail.com wrote:
how will u formulate the dp solution , as i was pointed by somebody that
its a
hello one request
if any one know how to test the Topcoder problems offline please help me
currently marathin56 is open
i wanted to test my solution
Regards
Jawahar
On Mon, Oct 12, 2009 at 4:41 PM, Brats rbharat...@gmail.com wrote:
Hey .. here is a problem I saw somewhere on net. Can anyone
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is entirely independent of the other sub-games.
A single '1' is always winnable (b = 1)
A string of 1s is
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is entirely independent of the other sub-games.
A single
2009/10/12 Bharath Raghavendran rbharat...@gmail.com
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is
On Mon, Oct 12, 2009 at 1:13 PM, Bharath Raghavendran
rbharat...@gmail.com wrote:
2009/10/12 Bharath Raghavendran rbharat...@gmail.com
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain
You should use Sprague-Grundy theory to solve this problem.
On Oct 12, 6:11 pm, Brats rbharat...@gmail.com wrote:
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
10 matches
Mail list logo
