306300 | CF1175E. Minimal Segment Cover | 0 | 0 | 0.000% |
306311 | CF1178A. Prime Minister | 0 | 0 | 0.000% |
306654 | CF1230B. Ania and Minimizing | 0 | 0 | 0.000% |
306660 | CF1231B. Ania and Minimizing | 0 | 0 | 0.000% |
306731 | CF1244E. Minimizing Difference | 0 | 0 | 0.000% |
306785 | CF1251C. Minimize The Integer | 0 | 0 | 0.000% |
306822 | CF1256B. Minimize the Permutation | 0 | 0 | 0.000% |
306824 | CF1256D. Binary String Minimizing | 0 | 0 | 0.000% |
307025 | CF1288D. Minimax Problem | 0 | 0 | 0.000% |
307293 | CF1334D. Minimum Euler Cycle | 0 | 0 | 0.000% |
307418 | CF1354F. Summoning Minions | 0 | 0 | 0.000% |
307466 | CF1360A. Minimal Square | 0 | 0 | 0.000% |
307581 | CF1377A1. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307582 | CF1377A2. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307583 | CF1377A3. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307584 | CF1378A1. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307585 | CF1378A2. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307586 | CF1378A3. Huawei Graph Mining Challenge | 0 | 0 | 0.000% |
307637 | CF1387B1. Village (Minimum) | 0 | 0 | 0.000% |
307756 | CF1409B. Minimum Product | 0 | 0 | 0.000% |
307903 | CF1432E. Binary String Minimizing | 0 | 0 | 0.000% |
307931 | CF1437D. Minimal Height Tree | 0 | 0 | 0.000% |
308149 | CF1473E. Minimum Path | 0 | 0 | 0.000% |
308171 | CF1476G. Minimum Difference | 0 | 3 | 0.000% |
308184 | CF1479A. Searching Local Minimum | 0 | 0 | 0.000% |
308192 | CF1480C. Searching Local Minimum | 0 | 0 | 0.000% |
308237 | CF1487C. Minimum Ties | 0 | 0 | 0.000% |
308267 | CF1491B. Minimal Cost | 0 | 0 | 0.000% |
308319 | CF1499C. Minimum Grid Path | 0 | 0 | 0.000% |
308498 | CF1530E. Minimax | 0 | 0 | 0.000% |
308595 | CF1544E. Minimax | 0 | 0 | 0.000% |
308756 | CF1570I. Minimum Difference | 0 | 0 | 0.000% |
308816 | CF1579E1. Permutation Minimization by Deque | 0 | 0 | 0.000% |
308819 | CF1579G. Minimal Coverage | 0 | 0 | 0.000% |
308857 | CF1585C. Minimize Distance | 0 | 0 | 0.000% |
308885 | CF1591C. Minimize Distance | 0 | 0 | 0.000% |
308976 | CF1607C. Minimum Extraction | 0 | 0 | 0.000% |
309175 | CF1637D. Yet Another Minimization Problem | 0 | 0 | 0.000% |
309179 | CF1637H. Minimize Inversions Number | 0 | 0 | 0.000% |
309265 | CF1652F. Minimal String Xoration | 0 | 0 | 0.000% |
309272 | CF1654F. Minimal String Xoration | 0 | 0 | 0.000% |
309274 | CF1654H. Three Minimums | 0 | 0 | 0.000% |
309343 | CF1665E. MinimizOR | 0 | 0 | 0.000% |
309415 | CF1675E. Replace With the Previous, Minimize | 0 | 0 | 0.000% |
309446 | CF1680A. Minimums and Maximums | 0 | 0 | 0.000% |
309464 | CF1684A. Digit Minimization | 0 | 0 | 0.000% |
309472 | CF1685A. Circular Local MiniMax | 0 | 0 | 0.000% |
309480 | CF1686C. Circular Local MiniMax | 0 | 0 | 0.000% |
309608 | CF1706A. Another String Minimization Problem | 0 | 0 | 0.000% |
309657 | CF1714C. Minimum Varied Number | 0 | 5 | 0.000% |
309753 | CF1730C. Minimum Notation | 0 | 0 | 0.000% |
309755 | CF1730E. Maximums and Minimums | 0 | 0 | 0.000% |
309826 | CF1741C. Minimize the Thickness | 0 | 0 | 0.000% |
309970 | CF1765M. Minimum LCM | 0 | 0 | 0.000% |
310011 | CF1771F. Hossam and Range Minimum Query | 0 | 0 | 0.000% |
310117 | CF1784F. Minimums or Medians | 0 | 0 | 0.000% |
310123 | CF1785F. Minimums or Medians | 0 | 0 | 0.000% |
310200 | CF1799C. Double Lexicographically Minimum | 0 | 0 | 0.000% |
310276 | CF1808E1. Minibuses on Venus (easy version) | 0 | 0 | 0.000% |
310277 | CF1808E2. Minibuses on Venus (medium version) | 0 | 0 | 0.000% |
310278 | CF1808E3. Minibuses on Venus (hard version) | 0 | 0 | 0.000% |
310466 | CF1838B. Minimize Permutation Subarrays | 0 | 0 | 0.000% |
310596 | CF1857C. Assembly via Minimums | 0 | 0 | 0.000% |
310753 | CF1881F. Minimum Maximum Distance | 0 | 0 | 0.000% |
310774 | CF1885A. Deterministic Scheduling for Extended Reality over 5G and Beyond | 0 | 0 | 0.000% |
310784 | CF1887C. Minimum Array | 0 | 0 | 0.000% |
310787 | CF1887F. Minimum Segments | 0 | 0 | 0.000% |
310794 | CF1888F. Minimum Array | 0 | 0 | 0.000% |
310826 | CF1895B. Points and Minimum Distance | 0 | 0 | 0.000% |
310990 | CF1918B. Minimize Inversions | 0 | 0 | 0.000% |
311168 | CF1943F. Minimum Hamming Distance | 0 | 0 | 0.000% |
311311 | CF1969C. Minimizing the Sum | 0 | 0 | 0.000% |
400346 | GYM100147 B Hyper-minimum | 0 | 0 | 0.000% |
400368 | GYM100153 D Minimal Cut Matrix | 0 | 0 | 0.000% |
400472 | GYM100187 L Ministry of Truth | 0 | 0 | 0.000% |
400525 | GYM100201 B The Minimal Angle | 0 | 0 | 0.000% |
400653 | GYM100218 J Yet Another Minimal Triangle | 0 | 0 | 0.000% |
400736 | GYM100236 L Lexicographically Minimal Poem | 0 | 0 | 0.000% |
401030 | GYM100325 H Range Minimum Query | 0 | 0 | 0.000% |
401087 | GYM100342 E Minima | 0 | 0 | 0.000% |
401331 | GYM100402 B Minimal Matrix | 0 | 0 | 0.000% |
401336 | GYM100402 G Inverse Range Minimum Query | 0 | 0 | 0.000% |
401431 | GYM100448 F Data Mining | 0 | 0 | 0.000% |
401583 | GYM100496 D Data Mining | 0 | 0 | 0.000% |
401683 | GYM100513 H Minimal Agapov Code | 0 | 0 | 0.000% |
402033 | GYM100625 A Administrative Difficulties | 0 | 0 | 0.000% |
402509 | GYM100796 C Minimax Tree | 0 | 0 | 0.000% |
403007 | GYM100963 I Minimum Bounding Rectangle | 0 | 0 | 0.000% |
403171 | GYM101059 F Minimize Tree | 0 | 0 | 0.000% |
403216 | GYM101078 K Сunning Minister | 0 | 0 | 0.000% |
403491 | GYM101175 H Mining Your Own Business | 0 | 0 | 0.000% |
403600 | GYM101205 G Minimum Cost Flow | 0 | 0 | 0.000% |
404012 | GYM101388 D Data Mining | 0 | 0 | 0.000% |
404134 | GYM101415 C Minimal Backgammon | 0 | 0 | 0.000% |
404674 | GYM101606 J Just A Minim | 0 | 0 | 0.000% |
405049 | GYM101755 B Minimal Area | 0 | 0 | 0.000% |
405178 | GYM101810 F Minimum Sum of Array | 0 | 0 | 0.000% |
405371 | GYM101917 D Freddy and minifier | 0 | 0 | 0.000% |
405373 | GYM101917 F Minimum Played Times | 0 | 0 | 0.000% |
405481 | GYM101972 G Minimax | 0 | 0 | 0.000% |