| # | ID | Name | Difficulty | Solver |
|---|---|---|---|---|
| 1 | abc368_d | D. Minimum Steiner Tree | 816 | 7830 |
| 2 | abc315_e | E. Prerequisites | 921 | 6339 |
| 3 | abc223_d | D. Restricted Permutation | 1069 | 6710 |
| 4 | abc291_e | E. Find Permutation | 1069 | 5820 |
| 5 | abc245_f | F. Endless Walk | 1451 | 4065 |
| 6 | nikkei2019_qual_d | D. Restore the Tree | 1541 | 2615 |
| 7 | abc041_d | D. 徒競走 | 1670 | 2291 |
| 8 | dp_g | G. Longest Path | null | 29355 |
| 9 | typical90_bs | 071. Fuzzy Priority（★7） | null | 568 |
| 10 | tenka1_2016_qualA_c | C. 山田山本問題 | null | 448 |
| 11 | joisc2008_sheet | sheet. 色紙 (Sheet) | null | 391 |
| 12 | maximum_2013_h | H. さいたまの矛盾 | null | 50 |