← All problemsSign in

XOR Sums

CodeChefRating 2306Open on judge ↗

You are given a sequence of positive integers $A_1, A_2, \ldots, A_N$. You should answer $Q$ queries. In each query: - You are given a positive integer $M$. - Consider all non-empty subsequences of $A$ with length $\le M$. Recall that a subsequence is any sequence that can be created by deleting zero or more elements without changing the order of the remaining elements. - For each of these subs

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