(https://cses.fi/problemset/task/2208/)
How can I solve this problem? Please, anyone help...
Thanks to everyone.
# | User | Rating |
---|---|---|
1 | tourist | 3778 |
2 | Benq | 3592 |
3 | ecnerwala | 3521 |
4 | Um_nik | 3423 |
5 | jiangly | 3375 |
6 | Petr | 3342 |
7 | Radewoosh | 3337 |
8 | scott_wu | 3313 |
9 | maroonrk | 3265 |
10 | yosupo | 3259 |
# | User | Contrib. |
---|---|---|
1 | Errichto | 201 |
2 | 1-gon | 200 |
3 | rng_58 | 194 |
4 | SecondThread | 193 |
5 | awoo | 187 |
6 | vovuh | 183 |
7 | Um_nik | 182 |
8 | antontrygubO_o | 177 |
9 | Ashishgup | 175 |
10 | -is-this-fft- | 171 |
(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.