| 308114 | CF1468I. Plane Tiling | 0 | 0 | 0.000% |
| 308115 | CF1468J. Road Reform | 0 | 0 | 0.000% |
| 308116 | CF1468K. The Robot | 0 | 0 | 0.000% |
| 308117 | CF1468L. Prime Divisors Selection | 0 | 0 | 0.000% |
| 308118 | CF1468M. Similar Sets | 0 | 0 | 0.000% |
| 308119 | CF1468N. Waste Sorting | 0 | 0 | 0.000% |
| 309136 | CF1630A. And Matching | 0 | 0 | 0.000% |
| 309137 | CF1630B. Range and Partition | 0 | 0 | 0.000% |
| 309138 | CF1630C. Paint the Middle | 0 | 0 | 0.000% |
| 309139 | CF1630D. Flipping Range | 0 | 0 | 0.000% |
| 309140 | CF1630E. Expected Components | 0 | 0 | 0.000% |
| 309141 | CF1630F. Making It Bipartite | 0 | 0 | 0.000% |
| 309142 | CF1631A. Min Max Swap | 0 | 0 | 0.000% |
| 309143 | CF1631B. Fun with Even Subarrays | 0 | 0 | 0.000% |
| 309144 | CF1631C. And Matching | 0 | 0 | 0.000% |
| 309145 | CF1631D. Range and Partition | 0 | 0 | 0.000% |
| 309146 | CF1631E. Paint the Middle | 0 | 0 | 0.000% |
| 309147 | CF1631F. Flipping Range | 0 | 0 | 0.000% |
| 309362 | CF1668A. Direction Change | 0 | 0 | 0.000% |
| 309363 | CF1668B. Social Distance | 0 | 0 | 0.000% |
| 309364 | CF1668C. Make it Increasing | 0 | 0 | 0.000% |
| 309365 | CF1668D. Optimal Partition | 0 | 0 | 0.000% |
| 309366 | CF1668E. Half Queen Cover | 0 | 0 | 0.000% |
| 309367 | CF1668F. Edge Elimination | 0 | 0 | 0.000% |
| 309446 | CF1680A. Minimums and Maximums | 0 | 0 | 0.000% |
| 309447 | CF1680B. Robots | 0 | 0 | 0.000% |
| 309448 | CF1680C. Binary String | 0 | 0 | 0.000% |
| 309449 | CF1680D. Dog Walking | 0 | 0 | 0.000% |
| 309450 | CF1680E. Moving Chips | 0 | 0 | 0.000% |
| 309451 | CF1680F. Lenient Vertex Cover | 0 | 0 | 0.000% |
| 309452 | CF1681A. Game with Cards | 0 | 0 | 0.000% |
| 309453 | CF1681B. Card Trick | 0 | 0 | 0.000% |
| 309454 | CF1681C. Double Sort | 0 | 0 | 0.000% |
| 309455 | CF1681D. Required Length | 0 | 0 | 0.000% |
| 309456 | CF1681E. Labyrinth Adventures | 0 | 0 | 0.000% |
| 309457 | CF1681F. Unique Occurrences | 0 | 0 | 0.000% |
| 309458 | CF1682A. Palindromic Indices | 0 | 0 | 0.000% |
| 309459 | CF1682B. AND Sorting | 0 | 0 | 0.000% |
| 309460 | CF1682C. LIS or Reverse LIS? | 0 | 0 | 0.000% |
| 309461 | CF1682D. Circular Spanning Tree | 0 | 0 | 0.000% |
| 309462 | CF1682E. Unordered Swaps | 0 | 0 | 0.000% |
| 309463 | CF1682F. MCMF? | 0 | 0 | 0.000% |
| 309464 | CF1684A. Digit Minimization | 0 | 0 | 0.000% |
| 309465 | CF1684B. Z mod X = C | 0 | 0 | 0.000% |
| 309466 | CF1684C. Column Swapping | 0 | 0 | 0.000% |
| 309467 | CF1684D. Traps | 0 | 0 | 0.000% |
| 309468 | CF1684E. MEX vs DIFF | 0 | 0 | 0.000% |
| 309469 | CF1684F. Diverse Segments | 0 | 0 | 0.000% |
| 309470 | CF1684G. Euclid Guess | 0 | 0 | 0.000% |
| 309471 | CF1684H. Hard Cut | 0 | 0 | 0.000% |
| 309472 | CF1685A. Circular Local MiniMax | 0 | 0 | 0.000% |
| 309473 | CF1685B. Linguistics | 0 | 0 | 0.000% |
| 309474 | CF1685C. Bring Balance | 0 | 0 | 0.000% |
| 309475 | CF1685D1. Permutation Weight (Easy Version) | 0 | 0 | 0.000% |
| 309476 | CF1685D2. Permutation Weight (Hard Version) | 0 | 0 | 0.000% |
| 309477 | CF1685E. The Ultimate LIS Problem | 0 | 0 | 0.000% |
| 309478 | CF1686A. Everything Everywhere All But One | 0 | 0 | 0.000% |
| 309479 | CF1686B. Odd Subarrays | 0 | 0 | 0.000% |
| 309480 | CF1686C. Circular Local MiniMax | 0 | 0 | 0.000% |
| 309481 | CF1686D. Linguistics | 0 | 0 | 0.000% |
| 309482 | CF1686E. Bring Balance | 0 | 0 | 0.000% |
| 309483 | CF1686F. Permutation Weight (Easy Version) | 0 | 0 | 0.000% |
| 309484 | CF1687A. The Enchanted Forest | 0 | 0 | 0.000% |
| 309485 | CF1687B. Railway System | 0 | 0 | 0.000% |
| 309486 | CF1687C. Sanae and Giant Robot | 0 | 0 | 0.000% |
| 309487 | CF1687D. Cute number | 0 | 0 | 0.000% |
| 309488 | CF1687E. Become Big For Me | 0 | 0 | 0.000% |
| 309489 | CF1687F. Koishi's Unconscious Permutation | 0 | 0 | 0.000% |
| 309490 | CF1688A. Cirno's Perfect Bitmasks Classroom | 0 | 0 | 0.000% |
| 309491 | CF1688B. Patchouli's Magical Talisman | 0 | 0 | 0.000% |
| 309492 | CF1688C. Manipulating History | 0 | 0 | 0.000% |
| 309493 | CF1688D. The Enchanted Forest | 0 | 0 | 0.000% |
| 309494 | CF1688E. Railway System | 0 | 0 | 0.000% |
| 309495 | CF1688F. Sanae and Giant Robot | 0 | 0 | 0.000% |
| 309496 | CF1689A. Lex String | 0 | 0 | 0.000% |
| 309497 | CF1689B. Mystic Permutation | 0 | 0 | 0.000% |
| 309498 | CF1689C. Infected Tree | 0 | 0 | 0.000% |
| 309499 | CF1689D. Lena and Matrix | 0 | 0 | 0.000% |
| 309500 | CF1689E. ANDfinity | 0 | 0 | 0.000% |
| 309984 | CF1768A. Greatest Convex | 0 | 0 | 0.000% |
| 309985 | CF1768B. Quick Sort | 0 | 0 | 0.000% |
| 309986 | CF1768C. Elemental Decompress | 0 | 0 | 0.000% |
| 309987 | CF1768D. Lucky Permutation | 0 | 0 | 0.000% |
| 309988 | CF1768E. Partial Sorting | 0 | 0 | 0.000% |
| 309989 | CF1768F. Wonderful Jump | 0 | 0 | 0.000% |
| 310369 | CF1823A. A-characteristic | 0 | 0 | 0.000% |
| 310370 | CF1823B. Sort with Step | 0 | 0 | 0.000% |
| 310371 | CF1823C. Strongly Composite | 0 | 0 | 0.000% |
| 310372 | CF1823D. Unique Palindromes | 0 | 0 | 0.000% |
| 310373 | CF1823E. Removing Graph | 0 | 0 | 0.000% |
| 310374 | CF1823F. Random Walk | 0 | 0 | 0.000% |
| 310670 | CF1868A. Fill in the Matrix | 0 | 0 | 0.000% |
| 310671 | CF1868B1. Candy Party (Easy Version) | 0 | 0 | 0.000% |
| 310672 | CF1868B2. Candy Party (Hard Version) | 0 | 0 | 0.000% |
| 310673 | CF1868C. Travel Plan | 0 | 0 | 0.000% |
| 310674 | CF1868D. Flower-like Pseudotree | 0 | 0 | 0.000% |
| 310675 | CF1868E. Min-Sum-Max | 0 | 0 | 0.000% |
| 310676 | CF1868F. LIS? | 0 | 0 | 0.000% |
| 311301 | CF1968A. Maximize? | 0 | 0 | 0.000% |
| 311302 | CF1968B. Prefiquence | 0 | 0 | 0.000% |