(https://cses.fi/problemset/task/2208/)
How can I solve this problem? Please, anyone help...
Thanks to everyone.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
(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.