(https://cses.fi/problemset/task/2208/)
How can I solve this problem? Please, anyone help...
Thanks to everyone.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
(https://cses.fi/problemset/task/2208/)
How can I solve this problem? Please, anyone help...
Thanks to everyone.
Name |
---|
.
Are you sure, because it is not Nim game.
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.
Thanks a lot.