| # | ID | Name | Difficulty | Solver |
|---|---|---|---|---|
| 1 | abc061_b | B. Counting Roads | 108 | 14705 |
| 2 | abc282_d | D. Make Bipartite 2 | 1154 | 4597 |
| 3 | arc022_3 | C. ロミオとジュリエット | 1694 | 1307 |
| 4 | abc280_f | F. Pay or Receive | 1819 | 1891 |
| 5 | code_festival_2017_qualb_c | C. 3 Steps | 1883 | 2135 |
| 6 | tenka1_2012_qualA_3 | C. 敵対的引用 | 1996 | 329 |
| 7 | abc286_g | G. Unique Walk | 2135 | 991 |
| 8 | arc115_d | D. Odd Degree | 2325 | 808 |
| 9 | abc210_f | F. Coprime Solitaire | 2632 | 549 |
| 10 | abc155_f | F. Perils in Parallel | 2738 | 745 |
| 11 | agc018_d | D. Tree and Hamilton Path | 2757 | 921 |
| 12 | agc017_e | E. Jigsaw | 3158 | 523 |
| 13 | arc069_d | F. Flags | 3200 | 729 |
| 14 | agc006_f | F. Blackout | 3530 | 805 |
| 15 | typical90_c | 003. Longest Circular Road（★4） | null | 6935 |
| 16 | typical90_bz | 078. Easy Graph Problem（★2） | null | 5720 |
| 17 | typical90_z | 026. Independent Set on a Tree（★4） | null | 4359 |
| 18 | agc001_c | C. Shorten Diameter | null | 2110 |
| 19 | maximum_cup_2018_c | C. 嘘つきな天使たち | null | 621 |
| 20 | past202104_g | G. One Step at a Time | null | 454 |
| 21 | kupc2017_e | E. Treasure Hunt | null | 207 |
| 22 | joi2012ho5 | E. JOI 国のお祭り事情 (Festivals in JOI Kingdom) | null | 166 |
| 23 | nyc2015_5 | E. ひも | null | 73 |