Magical Modulo
You are given an array $A$ of $N$ integers . You want to convert the array $A$ into a permutation of $N$ integers. To do this, you can apply the following operation on array $A$ **exactly once** . - Pick an integer $X$, where $1 \leq X \leq 2\cdot 10^7$. For each $i$ , $1 \leq i \leq N$ , replace $A_{i}$ by $A_{i} \% X$. Find out whether it is possible to convert $A$ into a permutation of $N$ in
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start