| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
+2
I guess you might try solving the combinatorics and inclusion-exclusion problems from this blog. Not necessarily similar to E but high-quality problems. |
|
+8
How to solve E? |
|
+13
The only reason why I was able to solve the 4th question was that I had seen this video from your Youtube channel in which you applied dfs on the trie. It's a simple and easy concept but still was very helpful. Thanks! |
|
+10
ecnerwala. I like his clean code and assert statements because they clearly indicate what his expectations are about the state of the program at that point. |
|
0
Another problem on SQRT Decomposition from Codeforces Trainings Season 3 Episode 7: Strange Queries |
|
0
Are you expecting a magic wand or something? Do a google search and you'll easily find the answers. |
|
+21
Hello sir, Please tell me how to be an attention whore. |
|
+8
Hi, You may also solve problem D from Codeforces #516 for practice. |
