Distinct Binary Strings

CodeChefRating 1262Open on judge ↗

You are given a binary string $S$ of length $N$. You have to perform the following operation **exactly** once: - Select an index $i$ $(1 \le i \leq N)$ and delete $S_i$ from $S$. The remaining parts of $S$ are concatenated in the same order. How many **distinct** binary strings of length $N-1$ can you get after applying this operation? ### Input - The first line of input contains a single inte

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