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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
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 |
---|