← All problemsSign in

Permutation Construction

CodeChefRating 2084Open on judge ↗

You are given two integers $N$ and $X$. Your task is to construct a permutation $P$ of $\{1, 2, \ldots, N\}$ which satisfies the following conditions: - $P_1 = X$ - Let $D$ be the *difference array* of $P$, i.e, $D$ is an array of length $N-1$ such that $D_i = P_{i+1} - P_i$ for $1 \leq i \lt N$. The array $D$ should be a [palindrome](https://en.wikipedia.org/wiki/Palindrome). If there are mult

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