What is meant by a perfect game?And,also please anyone give
me a clue for this problem.I used DP.But got Wrong answer.
                                              Asif.

> What is meant by a perfect game?And,also please anyone
give
> me a clue for this problem.I used DP.But got Wrong answer.
>                                               Asif.


?????
it's one of the easiest problem here.
it took me 3 minutes to code & check, AC from the first try.

it's classical recursive deeping/dynamic programming.
lets consider a function "bool result(int N)" which
returns 'true' if current player would win having N stones,
and 'false' if he wouldn't.
so, if N==0, current player loses; otherwise he wins if
there exists at least one i such as other player (adversary
of the current player) loses with N-K_i stones.
(I omit various checkings, dynamic saving of resulsts,
etc.)

P.S. It surely can be solved only by dynamic programming
with no recursion at all, but I think the solution would be
somewhat more complicated.