← All problemsSign in

OR What

CodeChefRating 1546Open on judge ↗

You are given two positive integers $N$ and $X$. Find any permutation $P$ of the integers $1$ to $N$ such that the number of indices $i$ ($1 \leq i \leq N$) satisfying $$ P_i \mid i = X $$ is as large as possible. Here, $\mid$ denotes the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) operation. A permutation of the integers $1$ to $N$ is an array of length $N$ that contains

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