| 306630 | CF1225G. To Make 1 | 0 | 0 | 0.000% |
| 306634 | CF1227D1. Optimal Subsequences (Easy Version) | 0 | 0 | 0.000% |
| 306635 | CF1227D2. Optimal Subsequences (Hard Version) | 0 | 0 | 0.000% |
| 306646 | CF1229A. Marcin and Training Camp | 0 | 0 | 0.000% |
| 306654 | CF1230B. Ania and Minimizing | 0 | 0 | 0.000% |
| 306656 | CF1230D. Marcin and Training Camp | 0 | 0 | 0.000% |
| 306660 | CF1231B. Ania and Minimizing | 0 | 0 | 0.000% |
| 306661 | CF1231C. Increasing Matrix | 0 | 0 | 0.000% |
| 306663 | CF1231E. Middle-Out | 0 | 0 | 0.000% |
| 306664 | CF1231F. Marcin and Training Camp | 0 | 0 | 0.000% |
| 306676 | CF1236A. Stones | 0 | 0 | 0.000% |
| 306678 | CF1236C. Labs | 0 | 0 | 0.000% |
| 306679 | CF1236D. Alice and the Doll | 0 | 0 | 0.000% |
| 306684 | CF1237C1. Balanced Removals (Easier) | 0 | 0 | 0.000% |
| 306685 | CF1237C2. Balanced Removals (Harder) | 0 | 0 | 0.000% |
| 306689 | CF1237G. Balanced Distribution | 0 | 0 | 0.000% |
| 306692 | CF1238B. Kill 'Em All | 0 | 0 | 0.000% |
| 306693 | CF1238C. Standard Free2play | 0 | 0 | 0.000% |
| 306697 | CF1238G. Adilbek and the Watering System | 0 | 0 | 0.000% |
| 306700 | CF1239C. Queue in the Train | 0 | 0 | 0.000% |
| 306704 | CF1240A. Save the Nature | 0 | 0 | 0.000% |
| 306712 | CF1241C. Save the Nature | 0 | 0 | 0.000% |
| 306731 | CF1244E. Minimizing Difference | 0 | 0 | 0.000% |
| 306733 | CF1244G. Running in Pairs | 0 | 0 | 0.000% |
| 306735 | CF1245B. Restricted RPS | 0 | 0 | 0.000% |
| 306737 | CF1245D. Shichikuji and Power Grid | 0 | 0 | 0.000% |
| 306743 | CF1246D. Tree Factory | 0 | 0 | 0.000% |
| 306754 | CF1248B. Grow The Tree | 0 | 0 | 0.000% |
| 306756 | CF1248D1. The World Is Just a Programming Task (Easy Version) | 0 | 0 | 0.000% |
| 306758 | CF1248E. Queue in the Train | 0 | 0 | 0.000% |
| 306763 | CF1249C1. Good Numbers (easy version) | 0 | 0 | 0.000% |
| 306764 | CF1249C2. Good Numbers (hard version) | 0 | 0 | 0.000% |
| 306765 | CF1249D1. Too Many Segments (easy version) | 0 | 0 | 0.000% |
| 306766 | CF1249D2. Too Many Segments (hard version) | 0 | 0 | 0.000% |
| 306784 | CF1251B. Binary Palindromes | 0 | 0 | 0.000% |
| 306785 | CF1251C. Minimize The Integer | 0 | 0 | 0.000% |
| 306786 | CF1251D. Salary Changing | 0 | 0 | 0.000% |
| 306787 | CF1251E1. Voting (Easy Version) | 0 | 0 | 0.000% |
| 306788 | CF1251E2. Voting (Hard Version) | 0 | 0 | 0.000% |
| 306794 | CF1252E. Songwriter | 0 | 0 | 0.000% |
| 306797 | CF1252H. Twin Buildings | 0 | 0 | 0.000% |
| 306803 | CF1253B. Silly Mistake | 0 | 0 | 0.000% |
| 306804 | CF1253C. Sweets Eating | 0 | 0 | 0.000% |
| 306805 | CF1253D. Harmonious Graph | 0 | 0 | 0.000% |
| 306806 | CF1253E. Antenna Coverage | 0 | 0 | 0.000% |
| 306808 | CF1254A. Feeding Chicken | 0 | 0 | 0.000% |
| 306809 | CF1254B1. Send Boxes to Alice (Easy Version) | 0 | 0 | 0.000% |
| 306810 | CF1254B2. Send Boxes to Alice (Hard Version) | 0 | 0 | 0.000% |
| 306817 | CF1255D. Feeding Chicken | 0 | 0 | 0.000% |
| 306818 | CF1255E1. Send Boxes to Alice (Easy Version) | 0 | 0 | 0.000% |
| 306819 | CF1255E2. Send Boxes to Alice (Hard Version) | 0 | 0 | 0.000% |
| 306822 | CF1256B. Minimize the Permutation | 0 | 0 | 0.000% |
| 306823 | CF1256C. Platforms Jumping | 0 | 0 | 0.000% |
| 306824 | CF1256D. Binary String Minimizing | 0 | 0 | 0.000% |
| 306825 | CF1256E. Yet Another Division Into Teams | 0 | 0 | 0.000% |
| 306827 | CF1257A. Two Rival Students | 0 | 0 | 0.000% |
| 306829 | CF1257C. Dominated Subarray | 0 | 0 | 0.000% |
| 306830 | CF1257D. Yet Another Monster Killing Problem | 0 | 0 | 0.000% |
| 306831 | CF1257E. The Contest | 0 | 0 | 0.000% |
| 306833 | CF1257G. Divisor Set | 0 | 0 | 0.000% |
| 306835 | CF1259B. Make Them Odd | 0 | 0 | 0.000% |
| 306836 | CF1259C. As Simple as One and Two | 0 | 0 | 0.000% |
| 306843 | CF1260C. Infinite Fence | 0 | 0 | 0.000% |
| 306844 | CF1260D. A Game with Traps | 0 | 0 | 0.000% |
| 306845 | CF1260E. Tournament | 0 | 0 | 0.000% |
| 306847 | CF1261A. Messy | 0 | 0 | 0.000% |
| 306848 | CF1261B1. Optimal Subsequences (Easy Version) | 0 | 0 | 0.000% |
| 306849 | CF1261B2. Optimal Subsequences (Hard Version) | 0 | 0 | 0.000% |
| 306850 | CF1261C. Arson In Berland Forest | 0 | 0 | 0.000% |
| 306853 | CF1261E. Not Same | 0 | 0 | 0.000% |
| 306855 | CF1262A. Math Problem | 0 | 0 | 0.000% |
| 306858 | CF1262D1. Optimal Subsequences (Easy Version) | 0 | 0 | 0.000% |
| 306859 | CF1262D2. Optimal Subsequences (Hard Version) | 0 | 0 | 0.000% |
| 306864 | CF1263B. PIN Codes | 0 | 0 | 0.000% |
| 306869 | CF1264A. Beautiful Regional Contest | 0 | 0 | 0.000% |
| 306870 | CF1264B. Beautiful Sequence | 0 | 0 | 0.000% |
| 306876 | CF1265A. Beautiful String | 0 | 0 | 0.000% |
| 306878 | CF1265C. Beautiful Regional Contest | 0 | 0 | 0.000% |
| 306879 | CF1265D. Beautiful Sequence | 0 | 0 | 0.000% |
| 306884 | CF1266C. Diverse Matrix | 0 | 0 | 0.000% |
| 306885 | CF1266D. Decreasing Debts | 0 | 0 | 0.000% |
| 306886 | CF1266E. Spaceship Solitaire | 0 | 0 | 0.000% |
| 306902 | CF1268A. Long Beautiful Integer | 0 | 0 | 0.000% |
| 306903 | CF1268B. Domino for Young | 0 | 0 | 0.000% |
| 306909 | CF1269C. Long Beautiful Integer | 0 | 0 | 0.000% |
| 306912 | CF1270A. Card Game | 0 | 0 | 0.000% |
| 306913 | CF1270B. Interesting Subarray | 0 | 0 | 0.000% |
| 306921 | CF1271A. Suits | 0 | 0 | 0.000% |
| 306922 | CF1271B. Blocks | 0 | 0 | 0.000% |
| 306923 | CF1271C. Shawarma Tent | 0 | 0 | 0.000% |
| 306924 | CF1271D. Portals | 0 | 0 | 0.000% |
| 306927 | CF1272A. Three Friends | 0 | 0 | 0.000% |
| 306928 | CF1272B. Snow Walking Robot | 0 | 0 | 0.000% |
| 306947 | CF1276A. As Simple as One and Two | 0 | 0 | 0.000% |
| 306949 | CF1276C. Beautiful Rectangle | 0 | 0 | 0.000% |
| 306954 | CF1277B. Make Them Odd | 0 | 0 | 0.000% |
| 306955 | CF1277C. As Simple as One and Two | 0 | 0 | 0.000% |
| 306958 | CF1277F. Beautiful Rectangle | 0 | 0 | 0.000% |
| 306960 | CF1278B. A and B | 0 | 0 | 0.000% |
| 306961 | CF1278C. Berry Jam | 0 | 0 | 0.000% |