| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
https://www.spoj.com/problems/TEAMNIM/
Yet the most interesting part is when two players from the same team make turns after each other, what kinda reminds index-2 nim but without taking 1 stone from one heap. Probably with correct AABB — ordering it won't be hard to come up to a good BAAB one, since there should be some invariant. Any ideas/hints?
Just analyze winning/losing states, not that hard.
Ok, thanks. Actually, it can be found in the internet. But just bruteforcing isn't interesting, I was rather interested in theoretical solution. But anyway, thanks.
Can I get some hints? I have already solved when players of both team alternate but am unable to find out how to solve other cases