Hide & Seek

CodeChefOpen on judge ↗

While walking down the street John saw a label $"Hide&Seek"$. Because he is a programmer, he used $&$ as a bitwise $AND$ for these two words represented as a integers in base64 and got new word. Now John thinks of some string $s$ and wants to know the number of pairs of words of length $|s|$ (length of $s$), such that their bitwise AND is equal to $s$. As this number can be large, output it modulo

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