Gnib it

CodeChefOpen on judge ↗

There is a vast amount of text data in the Universe. There is a search engine Gnib which searches the entire text of the Universe but the problem is this search engine is not as good as Google. Now, Morty wants to query a string to find it in the text. There is an integer parameter $X$ associated with every query which is decided by the search engine Gnib. You are given $Q$ queries each contain

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