Preparando MOJI
| # | Problema | Enviado | BOUA! | Taxa de BOUA's |
|---|---|---|---|---|
| CF1156D | 0-1-Tree | 0 | 0 | 0% |
| CF1156E | Special Segments of Permutation | 0 | 0 | 0% |
| CF1156F | Card Bag | 0 | 0 | 0% |
| CF1156G | Optimizer | 0 | 0 | 0% |
| CF1157A | Reachable Numbers | 0 | 0 | 0% |
| CF1157B | Long Number | 0 | 0 | 0% |
| CF1157D | N Problems During K Days | 0 | 0 | 0% |
| CF1157E | Minimum Array | 0 | 0 | 0% |
| CF1157F | Maximum Balanced Circle | 0 | 0 | 0% |
| CF1157G | Inverse of Rows and Columns | 0 | 0 | 0% |
| CF1157C1 | Increasing Subsequence (easy version) | 0 | 0 | 0% |
| CF1157C2 | Increasing Subsequence (hard version) | 0 | 0 | 0% |
| CF1158A | The Party and Sweets | 0 | 0 | 0% |
| CF1158B | The minimal unique substring | 0 | 0 | 0% |
| CF1158C | Permutation recovery | 0 | 0 | 0% |
| CF1158D | Winding polygonal line | 0 | 0 | 0% |
| CF1158E | Strange device | 0 | 0 | 0% |
| CF1158F | Density of subarrays | 0 | 0 | 0% |
| CF1159A | A pile of stones | 0 | 0 | 0% |
| CF1159B | Expansion coefficient of the array | 0 | 0 | 0% |
Filtro