| 310254 | CF1805E. There Should Be a Lot of Maximums | 0 | 0 | 0.000% |
| 310292 | CF1810G. The Maximum Prefix | 0 | 0 | 0.000% |
| 310428 | CF1832B. Maximum Sum | 0 | 0 | 0.000% |
| 310442 | CF1834B. Maximum Strength | 0 | 0 | 0.000% |
| 310463 | CF1837E. Playoff Fixing | 0 | 0 | 0.000% |
| 310595 | CF1857B. Maximum Rounding | 0 | 0 | 0.000% |
| 310611 | CF1859E. Maximum Monogonosity | 0 | 0 | 0.000% |
| 310724 | CF1876D. Lexichromatography | 0 | 0 | 0.000% |
| 310733 | CF1877F. Lexichromatography | 0 | 0 | 0.000% |
| 310753 | CF1881F. Minimum Maximum Distance | 0 | 4 | 0.000% |
| 310875 | CF1903D1. Maximum And Queries (easy version) | 0 | 0 | 0.000% |
| 310876 | CF1903D2. Maximum And Queries (hard version) | 0 | 0 | 0.000% |
| 310897 | CF1906F. Maximize The Value | 0 | 0 | 0.000% |
| 310926 | CF1910E. Maximum Sum Subarrays | 0 | 0 | 0.000% |
| 311069 | CF1930A. Maximise The Score | 0 | 0 | 0.000% |
| 311071 | CF1930C. Lexicographically Largest | 0 | 0 | 0.000% |
| 311075 | CF1930F. Maximize the Difference | 0 | 0 | 0.000% |
| 311185 | CF1946B. Maximum Sum | 0 | 0 | 0.000% |
| 311301 | CF1968A. Maximize? | 0 | 0 | 0.000% |
| 311353 | CF1973C. Cat, Fox and Double Maximum | 0 | 0 | 0.000% |
| 311354 | CF1973D. Cat, Fox and Maximum Array Split | 0 | 0 | 0.000% |
| 311356 | CF1973F. Maximum GCD Sum Queries | 0 | 0 | 0.000% |
| 311384 | CF1979A. Guess the Maximum | 0 | 0 | 0.000% |
| 311387 | CF1979D. Fixing a Binary String | 0 | 0 | 0.000% |
| 400046 | GYM100016 J Taxi | 0 | 0 | 0.000% |
| 400178 | GYM100085 H Huzita Axiom 6 | 0 | 0 | 0.000% |
| 400450 | GYM100186 B Time to read | 0 | 0 | 0.000% |
| 400451 | GYM100186 C The road | 0 | 0 | 0.000% |
| 400452 | GYM100186 D Test problem | 0 | 0 | 0.000% |
| 400453 | GYM100186 E Experts | 0 | 0 | 0.000% |
| 400454 | GYM100186 F Pair Programming | 0 | 0 | 0.000% |
| 400459 | GYM100186 K Quality assurance | 0 | 0 | 0.000% |
| 400528 | GYM100201 E Graduated Lexicographical Ordering | 0 | 0 | 0.000% |
| 400648 | GYM100218 E Mazes Exit Guide | 0 | 0 | 0.000% |
| 400686 | GYM100227 C Rational Approximation | 0 | 0 | 0.000% |
| 400736 | GYM100236 L Lexicographically Minimal Poem | 0 | 0 | 0.000% |
| 401043 | GYM100338 A Maximal Flows Dimension | 0 | 0 | 0.000% |
| 401255 | GYM100380 K1 Maximal clique (subtask 1) | 0 | 0 | 0.000% |
| 401256 | GYM100380 K2 Maximal clique (subtask 2) | 0 | 0 | 0.000% |
| 401257 | GYM100380 K3 Maximal clique (subtask 3) | 0 | 0 | 0.000% |
| 401258 | GYM100380 K4 Maximal clique (subtask 4) | 0 | 0 | 0.000% |
| 401259 | GYM100380 K5 Maximal clique (subtask 5) | 0 | 0 | 0.000% |
| 401260 | GYM100380 K6 Maximal clique (subtask 6) | 0 | 0 | 0.000% |
| 401306 | GYM100384 B Maximal Difference | 0 | 0 | 0.000% |
| 401318 | GYM100385 A Maximal Difference | 0 | 0 | 0.000% |
| 401377 | GYM100425 F Mexico | 0 | 0 | 0.000% |
| 401416 | GYM100443 A Mixing Colours | 0 | 0 | 0.000% |
| 401527 | GYM100490 A Approximation | 0 | 0 | 0.000% |
| 401562 | GYM100494 F Fixing the Bugs | 0 | 0 | 0.000% |
| 401719 | GYM100518 A Approximate Bounding Box | 0 | 0 | 0.000% |
| 401864 | GYM100548 A Built with Qinghuai and Ari Factor | 0 | 0 | 0.000% |
| 401865 | GYM100548 B Puzzle & Dragons | 0 | 0 | 0.000% |
| 401866 | GYM100548 C The Problem Needs 3D Arrays | 0 | 0 | 0.000% |
| 401867 | GYM100548 D The Diameter of Tree | 0 | 0 | 0.000% |
| 401868 | GYM100548 E Brushing King | 0 | 0 | 0.000% |
| 401869 | GYM100548 F Color | 0 | 0 | 0.000% |
| 401870 | GYM100548 G The Problem to Slow Down You | 0 | 0 | 0.000% |
| 401871 | GYM100548 H The Problem to Make You Happy | 0 | 0 | 0.000% |
| 401872 | GYM100548 I International Collegiate Routing Contest | 0 | 0 | 0.000% |
| 401873 | GYM100548 J Unlimited Battery Works | 0 | 0 | 0.000% |
| 401874 | GYM100548 K Last Defence | 0 | 0 | 0.000% |
| 401977 | GYM100608 J Jinxiety of a Polyomino | 0 | 0 | 0.000% |
| 402000 | GYM100622 A Auxiliary Question of the Universe | 0 | 0 | 0.000% |
| 402220 | GYM100703 C Aerotaxi | 0 | 0 | 0.000% |
| 402603 | GYM100819 P Complexity | 0 | 0 | 0.000% |
| 402800 | GYM100885 A Имена собственные | 0 | 0 | 0.000% |
| 402801 | GYM100885 B Железная дорога | 0 | 0 | 0.000% |
| 402802 | GYM100885 C The Last Number | 0 | 0 | 0.000% |
| 402803 | GYM100885 D Взять все остатки | 0 | 0 | 0.000% |
| 402804 | GYM100885 E Передача опыта | 0 | 0 | 0.000% |
| 402805 | GYM100885 F Светофоры | 0 | 0 | 0.000% |
| 402812 | GYM100886 G Maximum Product | 0 | 0 | 0.000% |
| 402869 | GYM100927 A Maximal Convex Subset | 0 | 0 | 0.000% |
| 403086 | GYM100994 E Maximal Sum | 0 | 0 | 0.000% |
| 403315 | GYM101116 K Mixing Bowls | 0 | 0 | 0.000% |
| 403431 | GYM101158 E Infallibly Crack Perplexing Cryptarithm | 0 | 0 | 0.000% |
| 403588 | GYM101201 G Maximum Islands | 0 | 0 | 0.000% |
| 403884 | GYM101353 B Max and Alexis Plan to Conquer the World | 0 | 0 | 0.000% |
| 403950 | GYM101371 F Maximal Clique | 0 | 0 | 0.000% |
| 403982 | GYM101382 A Complexity | 0 | 0 | 0.000% |
| 404162 | GYM101437 D Counter Complexity | 0 | 0 | 0.000% |
| 404237 | GYM101466 B Maximum Tree | 0 | 0 | 0.000% |
| 404262 | GYM101468 G Maximum | 0 | 0 | 0.000% |
| 404292 | GYM101472 F Maximal Number of Divisors | 0 | 0 | 0.000% |
| 404374 | GYM101490 C Brexit | 0 | 0 | 0.000% |
| 404395 | GYM101492 L Approximate Search | 0 | 0 | 0.000% |
| 404700 | GYM101612 A Auxiliary Project | 0 | 0 | 0.000% |
| 405048 | GYM101755 A Restoring Numbers | 0 | 0 | 0.000% |
| 405049 | GYM101755 B Minimal Area | 0 | 0 | 0.000% |
| 405050 | GYM101755 C Third-Party Software | 0 | 0 | 0.000% |
| 405051 | GYM101755 D Transfer Window | 0 | 0 | 0.000% |
| 405052 | GYM101755 E Substring Reverse | 0 | 0 | 0.000% |
| 405053 | GYM101755 F Tree Restoration | 0 | 0 | 0.000% |
| 405054 | GYM101755 G Underpalindromity | 0 | 0 | 0.000% |
| 405055 | GYM101755 H Safe Path | 0 | 0 | 0.000% |
| 405056 | GYM101755 I Guess the Tree | 0 | 0 | 0.000% |
| 405057 | GYM101755 J Parallelograms | 0 | 0 | 0.000% |
| 405058 | GYM101755 K Video Reviews | 0 | 0 | 0.000% |
| 405059 | GYM101755 L Queries on a String | 0 | 0 | 0.000% |
| 405060 | GYM101755 M Forgotten Spell | 0 | 0 | 0.000% |