Binary Strings

CodeChefOpen on judge ↗

Given two binary strings $A$ and $B$, count how many cyclic permutations of $B$ when taken $XOR$ with $A$ give $0$. ###Input: First line contains $T$, the number of testcases. Each testcase consists of two lines, first line contains $A$, and the next line contains $B$. ###Output: For each testcase, print the required answer in one line. ###Constraints: - $1 \leq T \leq 10$ - $1 \leq

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