Special String

CodeChefRating 2886Open on judge ↗

Consider the string of infinite length obtained by repeating `abcdefghijklmnopqrstuvwxyz` infinitely many times. That is, it looks like `abc...xyzabc...xyzabc...` Let string $B$ be the prefix of this string of length $M$. For example, - if $M = 6$, $B =$ `abcdef` - if $M = 29$, $B = $ `abcdefghijklmnopqrstuvwxyzabc` Vedansh calls a string $X$ special if it contains $B$ as a [substring](https:/

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