← All problemsSign in

XOR Equal Subtract

CodeChefRating 1570Open on judge ↗

An array $A$ is called *good* if the following condition is satisfied: - For all pairs $(i, j)$ such that $1 \le i < j \le |A|$, $A_i \oplus A_j = |A_i - A_j|$, where $\oplus$ represents the Bitwise XOR operator. --- You are given an array $A$ of $N$ integers. Find the maximum size of a good subsequence of $A$. ### Input - The first line of input will contain a single integer $T$, denoting the

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