Or Sum
Let's define $Score$ of an array $B$ of length $M$ as $\sum_{i=1}^{M} \sum_{j=i}^{M} f(i,j)$, where $f(i,j) = B_i$ $|$ $B_{i+1}$ $|$ $\dots$ $|$ $B_j$ (Here $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR)) You are given an array $A$, consisting of $N$ **distinct** elements. Find the sum of $Score$ over all $N!$ possible permutations of $A$. Since the a
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.
Sign in to chat with the tutor and save your progress.
Sign in to start