Just Arrays

CodeChefOpen on judge ↗

Dr. Watson is having an off day & Sherlock is worried about him.So he invites him to solve a mystery about a sequence of integers.Mystery is as follows: Given an array $A$ of $N$ integers & $M$ queries.In every query an integer $X$ is given.Let $S$ be the set of all the subarrays $S$$i$ of array $A$ such that the bitwise AND of all elements in $S$$i$ results to $X$.Let |Si| represent number of el

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