| 5942 | BZOJ1942：[Ceoi2007]Ministry | 0 | 0 | 0.000% |
| 6091 | BZOJ2091：[Poi2010]The Minima Game | 0 | 0 | 0.000% |
| 6801 | BZOJ2801：[Poi2012]Minimalist Security | 0 | 0 | 0.000% |
| 7080 | BZOJ3080：Minimum Variance Spanning Tree | 0 | 0 | 0.000% |
| 7345 | BZOJ3345：Pku2914 Minimum Cut | 0 | 0 | 0.000% |
| 7980 | BZOJ3980：[WF2012]Minimum Cost Flow | 0 | 0 | 0.000% |
| 101012 | [AtCoder]ABC101 C - Minimization | 0 | 0 | 0.000% |
| 101275 | [AtCoder]ABC127 F - Absolute Minima | 0 | 0 | 0.000% |
| 101305 | [AtCoder]ABC130 F - Minimum Bounding Box | 0 | 0 | 0.000% |
| 101332 | [AtCoder]ABC133 C - Remainder Minimization 2019 | 0 | 0 | 0.000% |
| 102031 | [AtCoder]ABC203 B - AtCoder Condominium | 0 | 0 | 0.000% |
| 102314 | [AtCoder]ABC231 E - Minimal payments | 0 | 0 | 0.000% |
| 102317 | [AtCoder]ABC231 H - Minimum Coloring | 0 | 0 | 0.000% |
| 102421 | [AtCoder]ABC242 B - Minimize Ordering | 0 | 0 | 0.000% |
| 102815 | [AtCoder]ABC281 F - Xor Minimization | 0 | 0 | 0.000% |
| 102956 | [Atcoder]ABC295 G - Minimum Reachable City | 0 | 2 | 0.000% |
| 102975 | [Atcoder]ABC297 F - Minimum Bounding Box 2 | 0 | 0 | 0.000% |
| 102996 | [Atcoder]ABC299 G - Minimum Permutation | 0 | 3 | 0.000% |
| 103086 | [Atcoder]ABC308 G - Minimum Xor Pair Query | 0 | 0 | 0.000% |
| 103193 | [Atcoder]ABC319 D - Minimum Width | 0 | 6 | 0.000% |
| 103301 | [Atcoder]ABC330 B - Minimize Abs 1 | 0 | 14 | 0.000% |
| 103302 | [Atcoder]ABC330 C - Minimize Abs 2 | 0 | 15 | 0.000% |
| 103305 | [Atcoder]ABC330 F - Minimize Bounding Square | 0 | 0 | 0.000% |
| 103484 | [Atcoder]ABC348 E - Minimize Sum of Distances | 0 | 4 | 0.000% |
| 103642 | [Atcoder]ABC364 C - Minimum Glutton | 0 | 14 | 0.000% |
| 103683 | [Atcoder]ABC368 D - Minimum Steiner Tree | 0 | 2 | 0.000% |
| 103735 | [Atcoder]ABC373 F - Knapsack with Diminishing Values | 0 | 5 | 0.000% |
| 200982 | [AtCoder]ARC098 E - Range Minimum Queries | 0 | 0 | 0.000% |
| 200990 | [AtCoder]ARC099 C - Minimization | 0 | 0 | 0.000% |
| 201294 | [AtCoder]ARC129 E - Yet Another Minimization | 0 | 0 | 0.000% |
| 201302 | [AtCoder]ARC130 C - Digit Sum Minimization | 0 | 0 | 0.000% |
| 201304 | [AtCoder]ARC130 E - Increasing Minimum | 0 | 0 | 0.000% |
| 201420 | [AtCoder]ARC142 A - Reverse and Minimize | 0 | 0 | 0.000% |
| 201423 | [AtCoder]ARC142 D - Deterministic Placing | 0 | 0 | 0.000% |
| 201534 | [AtCoder]ARC153 E - Deque Minimization | 0 | 0 | 0.000% |
| 300099 | CF22C. System Administrator | 0 | 0 | 0.000% |
| 300634 | CF120J. Minimum Sum | 0 | 0 | 0.000% |
| 300863 | CF164D. Minimum Diameter | 0 | 0 | 0.000% |
| 300881 | CF168B. Wizards and Minimal Spell | 0 | 0 | 0.000% |
| 301308 | CF245A. System Administrator | 0 | 0 | 0.000% |
| 301482 | CF279D. The Minimum Number of Variables | 0 | 0 | 0.000% |
| 301602 | CF303C. Minimum Modular | 0 | 0 | 0.000% |
| 301609 | CF304E. Minimum Modular | 0 | 0 | 0.000% |
| 302042 | CF388B. Fox and Minimal path | 0 | 0 | 0.000% |
| 302049 | CF389D. Fox and Minimal path | 0 | 0 | 0.000% |
| 302082 | CF394E. Lightbulb for Minister | 0 | 0 | 0.000% |
| 302453 | CF472C. Design Tutorial: Make It Nondeterministic | 0 | 0 | 0.000% |
| 302565 | CF496A. Minimum Difficulty | 0 | 0 | 0.000% |
| 302929 | CF571B. Minimization | 0 | 0 | 0.000% |
| 302936 | CF572D. Minimization | 0 | 0 | 0.000% |
| 303128 | CF609E. Minimum spanning tree for each edge | 0 | 0 | 0.000% |
| 303775 | CF730B. Minimum and Maximum | 0 | 0 | 0.000% |
| 304162 | CF797C. Minimal string | 0 | 0 | 0.000% |
| 304211 | CF804B. Minimum number of steps | 0 | 0 | 0.000% |
| 304219 | CF805D. Minimum number of steps | 0 | 0 | 0.000% |
| 304327 | CF825E. Minimal Labels | 0 | 0 | 0.000% |
| 304564 | CF868F. Yet Another Minimization Problem | 0 | 0 | 0.000% |
| 304572 | CF870B. Maximum of Maximums of Minimums | 0 | 0 | 0.000% |
| 304583 | CF872B. Maximum of Maximums of Minimums | 0 | 0 | 0.000% |
| 304685 | CF893F. Subtree Minimum Query | 0 | 0 | 0.000% |
| 304773 | CF910C. Minimum Sum | 0 | 0 | 0.000% |
| 304774 | CF911A. Nearest Minimums | 0 | 0 | 0.000% |
| 304837 | CF92101. Labyrinth-1 | 0 | 0 | 0.000% |
| 304838 | CF92102. Labyrinth-2 | 0 | 0 | 0.000% |
| 304839 | CF92103. Labyrinth-3 | 0 | 0 | 0.000% |
| 304840 | CF92104. Labyrinth-4 | 0 | 0 | 0.000% |
| 304841 | CF92105. Labyrinth-5 | 0 | 0 | 0.000% |
| 304842 | CF92106. Labyrinth-6 | 0 | 0 | 0.000% |
| 304843 | CF92107. Labyrinth-7 | 0 | 0 | 0.000% |
| 304844 | CF92108. Labyrinth-8 | 0 | 0 | 0.000% |
| 304845 | CF92109. Labyrinth-9 | 0 | 0 | 0.000% |
| 304846 | CF92110. Labyrinth-10 | 0 | 0 | 0.000% |
| 304847 | CF92111. Labyrinth-11 | 0 | 0 | 0.000% |
| 304848 | CF92112. Labyrinth-12 | 0 | 0 | 0.000% |
| 304849 | CF92113. Labyrinth-13 | 0 | 0 | 0.000% |
| 304850 | CF92114. Labyrinth-14 | 0 | 0 | 0.000% |
| 304868 | CF924F. Minimal Subset Difference | 0 | 0 | 0.000% |
| 305038 | CF956F. Minimal Subset Difference | 0 | 0 | 0.000% |
| 305067 | CF960B. Minimize the error | 0 | 0 | 0.000% |
| 305120 | CF976A. Minimum Binary Number | 0 | 0 | 0.000% |
| 305125 | CF976F. Minimal k-covering | 0 | 0 | 0.000% |
| 305286 | CF1002C1. Distinguish zero state and plus state with minimum error | 0 | 0 | 0.000% |
| 305322 | CF1007E. Mini Metro | 0 | 0 | 0.000% |
| 305329 | CF1009B. Minimum Ternary String | 0 | 0 | 0.000% |
| 305408 | CF1027C. Minimum Value Rectangle | 0 | 5 | 0.000% |
| 305437 | CF1031D. Minimum path | 0 | 0 | 0.000% |
| 305661 | CF1071B. Minimum path | 0 | 0 | 0.000% |
| 305668 | CF1072D. Minimum path | 0 | 0 | 0.000% |
| 305690 | CF1076A. Minimizing the String | 0 | 0 | 0.000% |
| 305752 | CF1085D. Minimum Diameter Tree | 0 | 0 | 0.000% |
| 305757 | CF1086B. Minimum Diameter Tree | 0 | 0 | 0.000% |
| 305765 | CF1087D. Minimum Diameter Tree | 0 | 0 | 0.000% |
| 305783 | CF1089J. JS Minification | 0 | 0 | 0.000% |
| 305813 | CF1092E. Minimal Diameter Forest | 0 | 0 | 0.000% |
| 305861 | CF1101A. Minimum Integer | 0 | 0 | 0.000% |
| 306061 | CF1140D. Minimum Triangulation | 0 | 0 | 0.000% |
| 306155 | CF1154G. Minimum Possible LCM | 0 | 0 | 0.000% |
| 306174 | CF1157E. Minimum Array | 0 | 0 | 0.000% |
| 306178 | CF1158B. The minimal unique substring | 0 | 0 | 0.000% |
| 306186 | CF1159D. The minimal unique substring | 0 | 0 | 0.000% |