Required Substring

CSESString AlgorithmsOpen on judge ↗

Your task is to calculate the number of strings of length n having a given pattern of length m as their substring. All strings consist of characters A–Z. Input The first input line has an integer n: the length of the final string. The second line has a pattern of length m. Output Print the number of strings modulo 10^9+7. Constraints - 1 \le n \le 1000 - 1 \le m \le 100 Example Input: 6

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