| # | 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 | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Codeforces Round #508 (Div. 2) — Editorials
I hope you guys enjoyed the contest — I hope to host another one soon :D
With that said, here are the tutorials:
Author's Code: 42591712
Author's Code: 42591830
Author's Code: 42591846
Author's Code: 42591882
Author's Code: 42592019
Author's Code: 42592026
Tester(cdkrot)'s Code: 42593206
For O(n3) or O(n2) solution, refer to this comment by pranjal.ssh
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Ashishgup | 2018-09-07 01:41:50 | 12 | Tiny change: ' $O(n^3)$ solutio' -> ' $O(n^3)$ or $O(n^2)$ solutio' | |
| en4 |
|
Ashishgup | 2018-09-07 00:01:27 | 139 | ||
| en3 |
|
Ashishgup | 2018-09-06 23:54:02 | 77 | Tiny change: ':42592026]' -> ':42592026]\nTester([user:_kun_])'s Code: [submission:42593028]' | |
| en2 |
|
Ashishgup | 2018-09-06 23:26:54 | 247 | ||
| en1 |
|
Ashishgup | 2018-09-06 23:07:18 | 326 | Initial revision (published) |
