Counting subarrays

CodeChefOpen on judge ↗

You are given a non-negative integer $x$ and an array $arr_1,arr_2...arr_n$ containing $n$ non-negative integers. We define the bitwise OR value of some subarray $arr[i...j]$ as $arr[i]|arr[i+1]|....|arr[j]$ where $|$ is the [bitwise OR](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_OR) operator. Find the number of non-empty subarrays of $arr$ having bitwise O

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