摘要:
C. Almost All Multiples Given two integers $n$ and $x$, a permutation$^{\dagger}$ $p$ of length $n$ is called funny if $p_i$ is a multiple of $i$ for 阅读全文
摘要:
E. Binary Inversions You are given a binary array$^{\dagger}$ of length $n$. You are allowed to perform one operation on it at most once. In an operat 阅读全文
摘要:
B. Elimination of a Ring Define a cyclic sequence of size $n$ as an array $s$ of length $n$, in which $s_n$ is adjacent to $s_1$. Muxii has a ring rep 阅读全文
摘要:
G. Restore the Permutation A sequence of $n$ numbers is called permutation if it contains all numbers from $1$ to $n$ exactly once. For example, the s 阅读全文
摘要:
Number of Beautiful Partitions You are given a string s that consists of the digits '1' to '9' and two integers k and minLength. A partition of s is c 阅读全文
摘要:
E. Hanging Hearts Pak Chanek has $n$ blank heart-shaped cards. Card $1$ is attached directly to the wall while each of the other cards is hanging onto 阅读全文
摘要:
D. Count GCD You are given two integers $n$ and $m$ and an array $a$ of $n$ integers. For each $1 \le i \le n$ it holds that $1 \le a_i \le m$. Your t 阅读全文
摘要:
D. Knowledge Cards Pak Chanek, a renowned scholar, invented a card puzzle using his knowledge. In the puzzle, you are given a board with $n$ rows and 阅读全文
摘要:
E. Cactus Wall Monocarp is playing Minecraft and wants to build a wall of cacti. He wants to build it on a field of sand of the size of $n \times m$ c 阅读全文