Tilling problem not understood

#1

pls provide the solution of the problem, I could not understand it from the editorial also.

#2

@Codarikh
The problem is quite simple if you think about it.
Implement the following recursive relation

Base conditions :

if (n<m)
    return 1;

if(n==m)
    return 2;

Recursive relation :

 f(n,m) = f(n-1,m) + f(n-m,m) ;

Since the constraints are large , you may need to use DP to optimise this however the recursive relation will remain same.

#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.