Explain me This Solution

#1

I am not getting this question and logic

#2

have you tried out tilling problem part 1 ?

#3

image
image1620×790 50.1 KB


explanation: major part could be understood by the pictorial representation( hopefully)

for (int i = 1; i <= n; i++) { 
        if (i > m) 
            count[i] = count[i - 1] + count[i - m]; 
        else if (i < m) 
            count[i] = 1; 
        else
            count[i] = 2; 
    }

so we have 1*m tile
placing horizontally reduces total size by 1
and placing vertically reduces by m
if ( i < m )
then it can be placed just in 1 way
else when i == m
2 possible adjustments ( horizontal and vertical are possible)

#4

Please Explain recursive approach for this

#5

the recursive case will give a tle here because of large constraints

#6

This is not giving correct Output. Code Link : https://ide.codingblocks.com/s/232361 , According to your Logic

#7

Thanks Got It , Just Added modulo 10^9 + 7. Thanks Chhavi bansal

1 Like
#8

if doubt is resolved
please mark it as resolved

if you have further doubts regarding this problem you can ask

#9

Hey @saurabhvit
sorry for the late reply.
Good to know u could do it on your own self

#10

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.