Family of Recurrences

CodeChefOpen on judge ↗

Suppose we have recurrences of the following form, characterized by three parameters **m**, **sigma1..m** and **f0..m-1**, where **m** > 0 and **sigmai** is a binary variable (1 i** = **fi** - Otherwise, i.e. **i** >= **m**, **si** = **fi - 1** * **sigma1** + ... + **fi - j** * **sigmaj** + ... + **fi - m** * **sigmam** Given **m, n, sigma1..m** and **f0..m-1**, compute **sn** modulo 10^9 + 7. #

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