Swegwan And Strings

CodeChefOpen on judge ↗

Mr. Swegwan loves to write problems, even though he can't solve all of them. He has given one such problem to his disciple Cherez. He wants Cherez to find the number of strings of length N composed of K alphabets (SwegScript can have any number of alphabets) such that every substring of length exactly equal to M is a palindrome. Since Cherez is not able to solve any of Mr. Swegwan's problems he as

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