Dominoes

CodeChefOpen on judge ↗

Given a 2xn rectangle/grid, you have to find the number of ways of tiling this rectangle/grid with 2x1 dominoes. Since the answer could be very large, you need to output it modulo 1000000007 (10^9 +7). Input The first line of the input contains an integer T, the number of test cases. Then T test cases follow. Each test case consists of a line which contains a positive integer, n. Output O

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