Fill_The_Blocks

CodeChefOpen on judge ↗

You have a block with the dimensions $4 × n$. Find the number of different ways you can fill this block with smaller blocks that have the dimensions $1$×$2$ or $2$x$1$. ###Input Given $T$,denotes no.of test cases. For each test case given $N$, which denotes the size of block. ###Output For each $N$, print the number of different ways to fill the $4 X N$ block using $1$×$2$

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