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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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 |
---|