R.G.D.M.'s blog

By R.G.D.M., history, 10 days ago, In English

(https://cses.fi/problemset/task/2208/)

How can I solve this problem? Please, anyone help...

Thanks to everyone.

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it

»
10 days ago, # |
Rev. 2   Vote: I like it +1 Vote: I do not like it

.

»
10 days ago, # |
  Vote: I like it +3 Vote: I do not like it

If atleast one odd value is available in the sequence ,then first will win the game. Otherwise , second will win.

EXPLAINATIN:
In optimal case , the current player will always try to make all the values in the sequence even. If there is one or more odd value(s) present in the sequence, then I will take 1 from each to make them even. This will leave all even values for the second player. This forces second player to take atleast 1 from the even values. It again gives me chance to pick one from the odds. At last there will be atleast one 1 for me to choose . And I will win the game.