| # | 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 | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
0
|
|
0
can someone tell me why am i wrong? |
|
0
can someone good man explain me problem D more detail? i mean to tell me clear dp state |
|
+5
thanks for great explanation. |
|
0
can someone explain more detail problem E?thanks. |
|
0
in problem 2 why f[v]=1 when we have only 1 vertex? |
|
0
is it can to solve qtree without hld? for example with centroid decomposition or some other technique? |
|
0
in problem frank sinatra, can i quickly find minimal number,that is not present in given set. |
|
0
can it gives me tle,if i can't use weight compress? |
|
0
can someone explain problem E more clearly?,thanks. |
|
0
can someone tell me how 208E is solved with this technique? thanks a lot. |
|
0
can't understand why we ans+=cnt[prefix[x]^k] what gives me prefix[x]^k? |
|
0
Ok |
| Name |
|---|


