Preparando MOJI
# | Problema | Enviado | BOUA! | Taxa de BOUA's |
---|---|---|---|---|
CF1680A | Minimums and Maximums | 0 | 0 | 0% |
CF1680B | Robots | 0 | 0 | 0% |
CF1680C | Binary String | 0 | 0 | 0% |
CF1680D | Dog Walking | 0 | 0 | 0% |
CF1680E | Moving Chips | 0 | 0 | 0% |
CF1680F | Lenient Vertex Cover | 0 | 0 | 0% |
CF1681A | Game with Cards | 0 | 0 | 0% |
CF1681B | Card Trick | 0 | 0 | 0% |
CF1681C | Double Sort | 0 | 0 | 0% |
CF1681D | Required Length | 0 | 0 | 0% |
CF1681E | Labyrinth Adventures | 0 | 0 | 0% |
CF1681F | Unique Occurrences | 0 | 0 | 0% |
CF1682A | Palindromic Indices | 0 | 0 | 0% |
CF1682B | AND Sorting | 0 | 0 | 0% |
CF1682C | LIS or Reverse LIS? | 0 | 0 | 0% |
CF1682D | Circular Spanning Tree | 0 | 0 | 0% |
CF1682E | Unordered Swaps | 0 | 0 | 0% |
CF1682F | MCMF? | 0 | 0 | 0% |
CF1684A | Digit Minimization | 0 | 0 | 0% |
CF1684B | Z mod X = C | 0 | 0 | 0% |
Filtro