Tilling problem - ii

#1

I can’t understand the editorial of this problem.

#2 
                count(n)= 1,when n < m  , Only one combination to place

n tiles of size 1 x m horizontally
on the floor of size n * m.

count(n) = 2,when n = m, we can place n tiles horizontally as well vertically
count(n) =count(n-1) + count(n-m), m < n

pls take a simple e.g and draw on the paper to see the arrangement

hope this will help u
pls rate my work so that i can improve my work

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.