| # | 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 | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
|
0
Can you help me explain why this solution is opimized base on hungarian solution |
|
+9
can u prove that Length of the sequence is n + m - gcd(n, m) - 1 ? |
|
0
I have a question how can we prove that W can be generated after doing the operation any number of times |
|
0
Can you explain solution E in the editor? I don't understand the k in dp [pos] [k] |
|
0
Can you explain a little bit about your code, pls? |
|
0
AntiBsayer In problem F, when ans == mx + 2, why do you sort the vertex by its size as a subtree out of greed ? Can you explain it |
|
+5
what about (n + i-1) / (n + i) ? Can you explain more, pleaes? |
|
0
Can you say how you solve it ? |
| Name |
|---|


