| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 8682 | P1866G Grouped Carriages | 0 / 0 | (None) | |
| 8673 | P1867C Salyg1n and the MEX Game | 0 / 0 | (None) | |
| 8672 | P1867D Cyclic Operations | 0 / 0 | (None) | |
| 8669 | P1867F Most Different Tree | 0 / 0 | (None) | |
| 8667 | P1868B1 Candy Party (Easy Version) | 0 / 0 | (None) | |
| 8666 | P1868B2 Candy Party (Hard Version) | 0 / 0 | (None) | |
| 8664 | P1868D Flower-like Pseudotree | 0 / 0 | (None) | |
| 8663 | P1868E Min-Sum-Max | 0 / 0 | (None) | |
| 8662 | P1868F LIS? | 0 / 0 | (None) | |
| 8748 | P1870A MEXanized Array | 0 / 0 | 3 | |
| 8747 | P1870B Friendly Arrays | 0 / 0 | 4 | |
| 8745 | P1870D Prefix Purchase | 0 / 0 | 6 | |
| 8741 | P1870H Standard Graph Problem | 0 / 0 | 10 | |
| 8659 | P1872A Two Vessels | 0 / 0 | (None) | |
| 8658 | P1872B The Corridor or There and Back Again | 0 / 0 | (None) | |
| 8653 | P1872G Replace With Product | 0 / 0 | (None) | |
| 8739 | P1873B Good Kid | 0 / 0 | 3 | |
| 8737 | P1873D 1D Eraser | 0 / 0 | 3 | |
| 8735 | P1873F Money Trees | 0 / 0 | 4 | |
| 8734 | P1873G ABBC or BACB | 0 / 0 | 5 | 
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.