Patterns by Switches

CodeChefOpen on judge ↗

There are $N$ switches. Initially, all switches are off. Coder X wants to do the following two operations any number of times in any order: - Choose $A$ consecutive switches and switch them off. - Choose $B$ consecutive switches and switch them on. Find the number of different patterns that Coder X can get after doing operations. Compute it modulo $10^{9} + 7$. ### Input - First and the only li

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