Tilling problrm

#1

https://ide.codingblocks.com/s/99805 we have been asked to try tilling problem with recursion but i am having problem doing so

#2

hey @nimishkhattar07, this is recursive equation for this question, Build you code according to that

count(n) =1, when 1 < = n < m
count(n) =2, when n= m
count(n) =count(n-1) + count(n-m), when m < n

#3

or this https://ide.codingblocks.com/s/99847

#4

hey @nimishkhattar07, this question has high contraints and timelimit is just few seconds. Thatswhy optimal approach is DP approach only. If you are familiar with DP. Try to implement it using DP.