Code Jam Round 1A starts in a few hours.
GL & HF.
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Code Jam Round 1A starts in a few hours.
GL & HF.
I didn't receive an email for this round but it will happen in a few hours.
GL & HF.
Whenever I try to log in I get the message "Your current applet version is out of date. Please restart the applet and refresh your internet browser cache". I'm using chrome and I've already cleared the cache and re-downloaded the arena but I'm getting the message over and over again. Does anyone else have this problem?
UPDATE:
The fact that Topcoder is testing a new arena might have something to do with it.
Link to the web arena for those who didn't read the blog post on Topcoder.
NEVERMIND: (They were updating the arena)
It's working now!!!
I'm trying to understand some concepts of game theory. So far I've understood how the game of nim works, at least the most basic form: as long as the current game has value > 0 the current player can change at least one of the piles such that the next turn will be played with value = 0. If the current game has value = 0 there are only 2 possibilities: Either the game is over and the player lost or he may pick a pile but by doing so in every case will yield value > 0 for the next player. I understood it by reading this Topcoder article. It clearly explains how to choose a pile when value > 0 and change it to value = 0 and that keeping value = 0 for two turns is impossible.
I am now trying to understand how the minimum excluded cardinal is equivalent to a nim value. How will always choosing the minimum value not appearing in the set always yield the correct result? How can the bigger values be discarded and not accounted for if those values can still be reached? Is there any intuitive way to know why this works?
UPD: Got the answer from here. The Topcoder article above also has the answer as kingofnumbers already said but I found it a little bit difficult to understand it with just that (it makes sense when you already understand it of course). Just in case someone eventually faces the same problem I left the link that helped me the most.
Name |
---|