Chef and Spliting Strings

CodeChefOpen on judge ↗

Chef is given a string of length $N$ and an integer $K$. Count the number of ways of splitting the string in parts, such that each part has a length $at most$ $K$. Since the answer may be large, output it modulo 1000000007. ###Input: - The first line of the input contains a single integer $T$ denoting the number of test cases. - First line of each test case contains two integ

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