Need help in performing recursive relation

#1
#2

Approach: For a given value of n and m, the number of ways to tile the floor can be obtained from the following relation.
count(n) = 1, 1 < = n < m
2, n = m
count(n-1) + count(n-m), m < n

#3

See the floor is of size n x m and tiles are of size 1 x m.
If n is less than m, i.e. n<m then you can place tiles in only 1 way
For example, Input : n = 2, m = 3
Output : 1
Only one combination to place
two tiles of size 1 x 3 horizontally
on the floor of size 2 x 3.
And
If n==m then there can be two ways like,
Input : n = 4, m = 4
Output : 2
1st combination:
All tiles are placed horizontally
2nd combination:
All tiles are placed vertically.
But, if n > m, then there can be multiple combinations including horizontals and verticals for which you have to calculate a recursive relation.

#4

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.