Counting Tilings

CSESDynamic ProgrammingOpen on judge ↗

Your task is to count the number of ways you can fill an n \times m grid using 1 \times 2 and 2 \times 1 tiles. Input The only input line has two integers n and m. Output Print one integer: the number of ways modulo 10^9+7. Constraints - 1 \le n \le 10 - 1 \le m \le 1000 Example Input: 4 7 Output: 781

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