The 2023 ICPC Asia Xi’an Regional Contest
The 3rd Universal Cup. Stage 9: Xi’an
Osijek Competitive Programming Camp Fall 2024. Day 8. Xi’an Contest
Date 2025-09-29
Upsolved 6/13
| A | B | C | D | E | F | G | H | I | J | K | L | M | N |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| O | Ø | O | O | Ø | O |
The 2023 ICPC Asia Xi’an Regional Contest
The 3rd Universal Cup. Stage 9: Xi’an
Osijek Competitive Programming Camp Fall 2024. Day 8. Xi’an Contest
Date 2025-09-29
Upsolved 6/13
| A | B | C | D | E | F | G | H | I | J | K | L | M | N |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| O | Ø | O | O | Ø | O |
The 2023 ICPC Asia Shenyang Regional Contest
The 2nd Universal Cup. Stage 13: Shenyang
Date 2025.08.24
Solved 6 / 13
| A | B | C | D | E | F | G | H | I | J | K | L | M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Ø | O | 待补 | O | O | O | O |
The 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau)
| Problems | AC | Note |
|---|---|---|
| A. (-1,1)-Sumplete | ⊕ | 构造 |
| B. Basic Equation Solving | 不可做 | |
| C. Bladestorm | 不可做 | |
| D. Graph of Maximum Degree 3 | ⊕ | 观察性质 |
| E. Inverse Topological Sort | ⊕ | 构造、拓扑排序 |
| F. Land Trade | 不可做 | |
| G. Parity Game | 不可做 | |
| H. Random Tree Parking | ⊕ | 树形背包、排列组合、随机生成数据 |
| I. Refresher into Midas | ○ | |
| J. Teleportation | ○ | 分层图、构造 |
| K. Understand | 不可做 |
2023 Jiangsu Collegiate Programming Contest
2023 National Invitational of CCPC (Hunan)
The 13th Xiangtan Collegiate Programming Contest
| Problems | AC |
|---|---|
| A. Today’s Word | ○ |
| B. Honkai in TAIKULA | |
| C. GG and YY’s Game | |
| D. Star Rail | |
| E. LCM Plus GCD | ⊕ |
| F. Timaeus | ○ |
| G. Moving Boxes | |
| H. Neil’s Machine | ○ |
| I. Elevator | ○ |
| J. Similarity (Easy Version) | ○ |
| K. Similarity (Hard Version) | ○ |
| L. Architect | ○ |
| Problems | AC |
|---|---|
| A. Orders | ○ |
| B. Building Company | ○ |
| C. Trie | |
| D. Fast and Fat | ○ |
| E. Math Problem | ○ |
| F. Colorful Segments | ⊕ |
| G. Matching | ○ |
| H. Be Careful 2 | |
| I. Three Dice | ○ |
| J. Not Another Path Query Problem | ⊕ |
| K. Difficult Constructive Problem | |
| L. Puzzle: Sashigane | ○ |
| M. Computational Geometry | ○ |