Weird Thought Of Fazlu

CodeChefOpen on judge ↗

In the forth coming days, we will be in College. Waiting anxiously for the college to open Mr. Fazlu is getting weird thoughts. One of his thoughts is: We have strings of length K based on the alphabet of size N. And he calls any of its substring beautiful if it is a palindrome and has a length S. You need to help Mr. Fazlu by finding (the number of strings having any of its substring “beau

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