| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
|
0
How would you perform binary search in [L,R] to count no of positions? |
|
0
Queue for practice section takes very long time , but for virtual contest , it was normal. I just did it. I think they are focusing on contests more for their smoothness. And Queue got larger. Waiting....... from last half hour for single submission. |
|
0
ok understood it. That really made the whole question. Thanks bro. |
|
0
can someone explain last line for f. with example? why orient (v,to) to (to,v)? |
|
0
what does map<> h stores? count of occurrences of colors? |
|
+2
And different ways to solve this problem please. I understood the way using dp as suggested by Pixar using dfs and dp using pathLength. What are other ways to solve problem. Full discription please. |
|
0
Can anyone give detailed solution for problem C,Div 2 |
|
0
What is correct answer for test case #44 for problem B. Is it -1. |
|
On
MikeMirzayanov →
Getting ready for ACM-ICPC 2016-2017: weekly trainings on Codeforces, 10 years ago
-17
is it rated? |
