← All problemsSign in

Zawad and Index Sum

CodeChefRating 2634Open on judge ↗

Zawad is a rare competitive programmer — he takes his studies seriously. One day, while studying in a library, he found a pattern $P$ in a century old book. The pattern is a string of lowercase English letters, with length $M$. Since Zawad is a curious boy, he started experimenting with the pattern. In one experiment, Zawad considers all $26^N$ strings with length $N$ that contain only lowercase

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

Sign in to chat with the tutor and save your progress.

Sign in to start