← All problemsSign in

1-2 Reorder

CodeChefRating 2416Open on judge ↗

Alice has an array $A$ of length $N$. Every element of $A$ is either $1$ or $2$. Alice will modify the array according to the following process: - First, choose a permutation $P$ of the integers $[1, 2, \ldots, N-1]$. A permutation of the integers $[1, 2, \ldots, N-1]$ is an array of length $N-1$ that contains every integer from $1$ to $N-1$ exactly once. - Then, for each $i$ from $1$ to $N-1$

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.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start