| 309797 | CF1737D. Ela and the Wiring Wizard | 0 | 0 | 0.000% |
| 309804 | CF1738D. Permutation Addicts | 0 | 0 | 0.000% |
| 309806 | CF1738F. Connectivity Addicts | 0 | 0 | 0.000% |
| 309812 | CF1739D. Reset K Edges | 0 | 0 | 0.000% |
| 309823 | CF1740I. Arranging Crystal Balls | 0 | 0 | 0.000% |
| 309827 | CF1741D. Masha and a Beautiful Tree | 0 | 0 | 0.000% |
| 309830 | CF1741G. Kirill and Company | 0 | 0 | 0.000% |
| 309855 | CF1746D. Paths on the Tree | 0 | 0 | 0.000% |
| 309875 | CF1749E. Cactus Wall | 0 | 0 | 0.000% |
| 309891 | CF1753D. The Beach | 0 | 0 | 0.000% |
| 309900 | CF1754F. The Beach | 0 | 0 | 0.000% |
| 309911 | CF1758E. Tick, Tock | 0 | 0 | 0.000% |
| 309926 | CF1760G. SlavicG's Favorite Problem | 0 | 2 | 0.000% |
| 309929 | CF1761C. Set Construction | 0 | 0 | 0.000% |
| 309931 | CF1761E. Make It Connected | 0 | 0 | 0.000% |
| 309946 | CF1763E. Node Pairs | 0 | 0 | 0.000% |
| 309947 | CF1763F. Edge Queries | 0 | 0 | 0.000% |
| 309950 | CF1764C. Doremy's City Construction | 0 | 0 | 0.000% |
| 309982 | CF1767E. Algebra Flash | 0 | 0 | 0.000% |
| 309987 | CF1768D. Lucky Permutation | 0 | 0 | 0.000% |
| 310001 | CF1770D. Koxia and Game | 0 | 0 | 0.000% |
| 310017 | CF1772F. Copy of a Copy of a Copy | 0 | 0 | 0.000% |
| 310044 | CF1775D. Friendly Spiders | 0 | 0 | 0.000% |
| 310052 | CF1776F. Train Splitting | 0 | 0 | 0.000% |
| 310056 | CF1776J. Italian Data Centers | 0 | 0 | 0.000% |
| 310065 | CF1777E. Edge Reverse | 0 | 0 | 0.000% |
| 310072 | CF1778F. Maximizing Root | 0 | 0 | 0.000% |
| 310077 | CF1779E. Anya's Simultaneous Exhibition | 0 | 0 | 0.000% |
| 310079 | CF1779G. The Game of the Century | 0 | 0 | 0.000% |
| 310110 | CF1783F. Double Sort II | 0 | 0 | 0.000% |
| 310119 | CF1785B. Letter Exchange | 0 | 0 | 0.000% |
| 310128 | CF1786D. Letter Exchange | 0 | 0 | 0.000% |
| 310134 | CF1787D. Game on Axis | 0 | 0 | 0.000% |
| 310145 | CF1788F. XOR, Tree, and Queries | 0 | 0 | 0.000% |
| 310157 | CF1790F. Timofey and Black-White Tree | 0 | 0 | 0.000% |
| 310158 | CF1790G. Tokens on Graph | 0 | 0 | 0.000% |
| 310172 | CF1792F1. Graph Coloring (easy version) | 0 | 0 | 0.000% |
| 310173 | CF1792F2. Graph Coloring (hard version) | 0 | 0 | 0.000% |
| 310191 | CF1795G. Removal Sequences | 0 | 0 | 0.000% |
| 310196 | CF1796E. Colored Subgraphs | 0 | 0 | 0.000% |
| 310212 | CF1800E1. Unforgivable Curse (easy version) | 0 | 0 | 0.000% |
| 310213 | CF1800E2. Unforgivable Curse (hard version) | 0 | 0 | 0.000% |
| 310216 | CF1797A. Li Hua and Maze | 0 | 0 | 0.000% |
| 310231 | CF1801D. The way home | 0 | 0 | 0.000% |
| 310240 | CF1802F. The way home | 0 | 0 | 0.000% |
| 310246 | CF1804E. Routing | 0 | 0 | 0.000% |
| 310247 | CF1804F. Approximate Diameter | 0 | 0 | 0.000% |
| 310253 | CF1805D. A Wide, Wide Graph | 0 | 0 | 0.000% |
| 310284 | CF1809F. Traveling in Berland | 0 | 0 | 0.000% |
| 310290 | CF1810E. Monsters | 0 | 0 | 0.000% |
| 310299 | CF1811F. Is It Flower? | 0 | 0 | 0.000% |
| 310300 | CF1811G1. Vlad and the Nice Paths (easy version) | 0 | 0 | 0.000% |
| 310301 | CF1811G2. Vlad and the Nice Paths (hard version) | 0 | 1 | 0.000% |
| 310320 | CF1815B. Sum Graph | 0 | 0 | 0.000% |
| 310321 | CF1815C. Between | 0 | 0 | 0.000% |
| 310324 | CF1815F. OH NO1 (-2-3-4) | 0 | 0 | 0.000% |
| 310328 | CF1816D. Sum Graph | 0 | 0 | 0.000% |
| 310329 | CF1816E. Between | 0 | 0 | 0.000% |
| 310706 | CF1873H. Mad City | 0 | 1 | 0.000% |
| 311214 | CF1950G. Shuffling Songs | 0 | 14 | 0.000% |
| 311343 | CF1971H. ±1 | 0 | 0 | 0.000% |
| 400399 | GYM100162 F Longest Two Graphs Common String | 0 | 0 | 0.000% |
| 400465 | GYM100187 E Two Labyrinths | 0 | 0 | 0.000% |
| 400984 | GYM100299 K Digraphs | 0 | 0 | 0.000% |
| 401369 | GYM100418 I Pair of paths | 0 | 0 | 0.000% |
| 401572 | GYM100495 D Modulo maths | 0 | 0 | 0.000% |
| 401695 | GYM100514 G uehSlff | 0 | 0 | 0.000% |
| 401764 | GYM100524 B Bipartite Bicolored Graphs | 0 | 0 | 0.000% |
| 402642 | GYM100829 A Chasing the Cheetahs | 0 | 0 | 0.000% |
| 402869 | GYM100927 A Maximal Convex Subset | 0 | 0 | 0.000% |
| 402870 | GYM100927 B Death Star | 0 | 0 | 0.000% |
| 402871 | GYM100927 C Elevator | 0 | 0 | 0.000% |
| 402872 | GYM100927 D Numbers | 0 | 0 | 0.000% |
| 402873 | GYM100927 E Pareto's Domination | 0 | 0 | 0.000% |
| 402874 | GYM100927 F Soldiers | 0 | 0 | 0.000% |
| 402875 | GYM100927 G Stocks Dynamics | 0 | 0 | 0.000% |
| 402876 | GYM100927 H Vader's Trouble | 0 | 0 | 0.000% |
| 402877 | GYM100927 I War of the Empires | 0 | 0 | 0.000% |
| 402878 | GYM100927 J One Way | 0 | 0 | 0.000% |
| 402879 | GYM100927 K Wheels | 0 | 0 | 0.000% |
| 403514 | GYM101189 D Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths(Hard) | 0 | 0 | 0.000% |
| 403883 | GYM101353 A Charm Is Not Always Enough | 0 | 0 | 0.000% |
| 403884 | GYM101353 B Max and Alexis Plan to Conquer the World | 0 | 0 | 0.000% |
| 403885 | GYM101353 C Being Common is Too Mainstream | 0 | 0 | 0.000% |
| 403886 | GYM101353 D ShaatChara | 0 | 0 | 0.000% |
| 403887 | GYM101353 E Just One Swap | 0 | 0 | 0.000% |
| 403888 | GYM101353 F Halum and Candies | 0 | 0 | 0.000% |
| 403889 | GYM101353 G XOR 'em all | 0 | 0 | 0.000% |
| 403890 | GYM101353 H Simple Path | 0 | 0 | 0.000% |
| 403904 | GYM101365 I Shortest Paths | 0 | 0 | 0.000% |
| 404006 | GYM101385 G Power Sum Graphs | 0 | 0 | 0.000% |
| 404063 | GYM101408 H Matchsticks | 0 | 0 | 0.000% |
| 404264 | GYM101468 I "Shortest" pair of paths | 0 | 0 | 0.000% |
| 404399 | GYM101498 D Counting Paths | 0 | 0 | 0.000% |
| 405013 | GYM101741 C Cover the Paths | 0 | 0 | 0.000% |
| 405113 | GYM101798 H Cylindrical Graphs | 0 | 0 | 0.000% |
| 405162 | GYM101808 B Amer and Graphs | 0 | 0 | 0.000% |
| 405512 | GYM101982 H Repeating Goldbachs | 0 | 0 | 0.000% |
| 405612 | GYM102012 B Rikka with Line Graphs | 0 | 0 | 0.000% |
| 405617 | GYM102012 G Rikka with Intersections of Paths | 0 | 0 | 0.000% |