I can't understand the problem in my solution described below
We can create a tree and then find the pattern as follows:
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Help in Google APAC 2016 Round E problem C
I can't understand the problem in my solution described below
We can create a tree and then find the pattern as follows:
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 | yashv | 2016-01-31 22:06:32 | 0 | (published) | ||
en4 | yashv | 2016-01-31 22:05:56 | 124 | Tiny change: 'rd#s=p2)\nI can't ' -> 'rd#s=p2)\n\nI can't ' | ||
en3 | yashv | 2016-01-31 22:03:11 | 134 | Tiny change: '(where n' represent' - | ||
en2 | yashv | 2016-01-31 21:57:40 | 564 | |||
en1 | yashv | 2016-01-31 16:34:00 | 167 | Initial revision (saved to drafts) |
Name |
---|