| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
does MEX have specific data structures?
I feel quite anoyed with this problem
how can i count the number of MEX(simple path u to v) = m ( u,v is the same with v,u) on a tree rooted at 1?
and other query is swap the value of node u and node v
Related note: can i have some properties of MEX functions, i have some:
Sorry for bad english
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Haught_Veath | 2026-04-21 20:18:41 | 27 | Tiny change: 'el quite amnoyed with' -> 'el quite anoyed with' | |
| en1 |
|
Haught_Veath | 2026-04-21 20:17:48 | 488 | Initial revision (published) |
