| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
|
On
Ormlis →
Codeforces Round #857 (Div.1, Div.2, based on Moscow Open Olympiad in Informatics, rated), 4 years ago
0
B is Worst problem ever |
|
-15
Worst problem C ever |
|
0
Answer will always lie between n and INT64MAX and bitwise and from n to k >= bitwise and from n to k+1 therefore you can apply binary search . To find bitwise and from n to k you can search on net and get method easily . |
|
0
Thanks for keeping such a wonderful contest. It ended my big negative delta streak from past 7 contests. |
|
-10
QueryForces |
|
On
variety-jones →
CF Stress: A highly customizable no-code tool to stress test CF problems, 5 years ago
0
Thanks a lot for creating this awesome website . |
|
+7
GridForces |
|
0
This contest is hell tough for beginners like me |
|
0
Yeah works fine on this. |
|
0
What was the mistake ? Actually I am also getting error on same test case u got . |
|
+11
Is every problem in this contest interactive ? |
|
+7
Why has the Magic tab not disappeared yet ? |
|
0
One of Codeforces and other of Codechef |
|
0
Two contests on the same day damnn!! |
|
0
When will the editorials of this contest be released ? |
