Maximum Value from Binary strings
You are given two binary strings $A$ and $B$, each of length $N$. Consider a non-empty substring $A'$ of $A$ and a non-empty substring $B'$ of $B$, both of the same length. Let $X = A' \oplus B'$ be the string obtained by taking the exclusive OR of $A'$ and $B'$. You are also given a function $f(X)$, defined as $$f(X) = \left \lfloor \dfrac{|X|}{2^{X_{10}}} \right \rfloor$$ where $|X|$ denotes
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