| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 5494 | P1377 [TJOI2011] 树的序 | 0 / 0 | 7 | |
| 9970 | P5854 【模板】笛卡尔树 | 0 / 0 | 6 | |
| 10573 | P6453 [COCI 2008/2009 #4] PERIODNI | 0 / 0 | 8 | |
| 12466 | P7988 [USACO21DEC] HILO G | 0 / 0 | 7 | |
| 13337 | P9152 待黑白分明 | 0 / 0 | 9 | |
| 13969 | P9607 [CERC2019] Be Geeks! | 0 / 0 | 8 | |
| 14749 | P10173 「OICon-02」maxiMINImax | 0 / 0 | 7 | |
| 15654 | P10919 运输规划 | 0 / 0 | 8 | |
| 16038 | P11261 [COTS 2018] 直方图 Histogram | 0 / 0 | 7 | |
| 16083 | P11411 兰奇的卡牌游戏 | 0 / 0 | 8 | |
| 16469 | P11585 [KTSC 2022 R1] 直方图 | 0 / 0 | 9 | |
| 16308 | P11661 无聊 | 0 / 0 | 8 | |
| 19152 | P13647 [NOISG 2016] Fabric | 0 / 0 | 6 | |
| 19411 | P13947 [EC Final 2019] Permutation | 0 / 0 | 8 | |
| 20055 | P14672 [ICPC 2025 Seoul R] CPEquivalence | 0 / 0 | 8 | |
| 18366 | P14989 传送 | 0 / 0 | 6 |