| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
0
petar thank you so much for this editorial ....u rock man.. |
|
0
Thank you man,..thanks .nice tutorial i must say..very nicely written :) |
|
0
dude is it also called binary indexed trees.?..i tried looking for delta encoding...but didnt get anything relevant |
|
0
what does the statment (1&odd) implies here? |
|
+3
Thank you so much friend :) |
|
+11
Thank you so much friend.. :) good to learn new concepts in this competition.. hope i wont forget.. |
|
0
Thank you man...is the problems like DIV1500 and 1000 not that difficult to implement as compare to how much we think?... |
|
0
AWSEome reply man...thakns for keeping me motivated.. :) |
|
0
actually the problem is that people dont know about it...how interesting is this ...i mean the codeforces..i let people know in my college and everyone1 likes it...
|
|
-6
actually i feel that there should be more number of div 2...as they really helping us...and they will grow surely
|
| Name |
|---|


