| 309397 | CF1672I. PermutationForces | 0 | 0 | 0.000% |
| 309398 | CF1673A. Subtle Substring Subtraction | 0 | 0 | 0.000% |
| 309399 | CF1673B. A Perfectly Balanced String? | 0 | 0 | 0.000% |
| 309400 | CF1673C. Palindrome Basis | 0 | 0 | 0.000% |
| 309401 | CF1673D. Lost Arithmetic Progression | 0 | 0 | 0.000% |
| 309402 | CF1673E. Power or XOR? | 0 | 0 | 0.000% |
| 309403 | CF1673F. Anti-Theft Road Planning | 0 | 0 | 0.000% |
| 309404 | CF1674A. Number Transformation | 0 | 2 | 0.000% |
| 309405 | CF1674B. Dictionary | 0 | 1 | 0.000% |
| 309406 | CF1674C. Infinite Replacement | 0 | 0 | 0.000% |
| 309407 | CF1674D. A-B-C Sort | 0 | 0 | 0.000% |
| 309408 | CF1674E. Breaking the Wall | 0 | 0 | 0.000% |
| 309409 | CF1674F. Desktop Rearrangement | 0 | 0 | 0.000% |
| 309410 | CF1674G. Remove Directed Edges | 0 | 0 | 0.000% |
| 309411 | CF1675A. Food for Animals | 0 | 0 | 0.000% |
| 309412 | CF1675B. Make It Increasing | 0 | 0 | 0.000% |
| 309413 | CF1675C. Detective Task | 0 | 0 | 0.000% |
| 309414 | CF1675D. Vertical Paths | 0 | 0 | 0.000% |
| 309415 | CF1675E. Replace With the Previous, Minimize | 0 | 0 | 0.000% |
| 309416 | CF1675F. Vlad and Unfinished Business | 0 | 0 | 0.000% |
| 309417 | CF1675G. Sorting Pancakes | 0 | 0 | 0.000% |
| 309418 | CF1676A. Lucky? | 0 | 14 | 0.000% |
| 309419 | CF1676B. Equal Candies | 0 | 13 | 0.000% |
| 309420 | CF1676C. Most Similar Words | 0 | 11 | 0.000% |
| 309421 | CF1676D. X-Sum | 0 | 19 | 0.000% |
| 309422 | CF1676E. Eating Queries | 0 | 23 | 0.000% |
| 309423 | CF1676F. Longest Strike | 0 | 28 | 0.000% |
| 309424 | CF1676G. White-Black Balanced Subtrees | 0 | 9 | 0.000% |
| 309425 | CF1676H1. Maximum Crossings (Easy Version) | 0 | 4 | 0.000% |
| 309426 | CF1676H2. Maximum Crossings (Hard Version) | 0 | 19 | 0.000% |
| 309427 | CF1677A. Tokitsukaze and Strange Inequality | 0 | 0 | 0.000% |
| 309428 | CF1677B. Tokitsukaze and Meeting | 0 | 0 | 0.000% |
| 309429 | CF1677C. Tokitsukaze and Two Colorful Tapes | 0 | 0 | 0.000% |
| 309430 | CF1677D. Tokitsukaze and Permutations | 0 | 0 | 0.000% |
| 309431 | CF1677E. Tokitsukaze and Beautiful Subsegments | 0 | 0 | 0.000% |
| 309432 | CF1677F. Tokitsukaze and Gems | 0 | 0 | 0.000% |
| 309433 | CF1678A. Tokitsukaze and All Zero Sequence | 0 | 0 | 0.000% |
| 309434 | CF1678B1. Tokitsukaze and Good 01-String (easy version) | 0 | 0 | 0.000% |
| 309435 | CF1678B2. Tokitsukaze and Good 01-String (hard version) | 0 | 0 | 0.000% |
| 309436 | CF1678C. Tokitsukaze and Strange Inequality | 0 | 0 | 0.000% |
| 309437 | CF1678D. Tokitsukaze and Meeting | 0 | 0 | 0.000% |
| 309438 | CF1678E. Tokitsukaze and Two Colorful Tapes | 0 | 0 | 0.000% |
| 309439 | CF1678F. Tokitsukaze and Permutations | 0 | 0 | 0.000% |
| 309440 | CF1679A. AvtoBus | 0 | 0 | 0.000% |
| 309441 | CF1679B. Stone Age Problem | 0 | 0 | 0.000% |
| 309442 | CF1679C. Rooks Defenders | 0 | 0 | 0.000% |
| 309443 | CF1679D. Toss a Coin to Your Graph... | 0 | 0 | 0.000% |
| 309444 | CF1679E. Typical Party in Dorm | 0 | 0 | 0.000% |
| 309445 | CF1679F. Formalism for Formalism | 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% |