Really Easy Tiling

CodeChefOpen on judge ↗

We wish to tile a grid of size Nx2 with rectangles (dominoes) of 2x1 (in either orientation). Write a program that takes input N and outputs the number of different ways to tile the grid. Output the ans mod 10^9 + 7. Input First line contains T (number of test case) Next T lines contains N(height of grid) Output T lines with desired ans mod 1000000007 in each line Constraints 1 Example In

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