Can anyone help me with this problem?

Revision en7, by hritikkumar, 2020-06-14 04:53:05

Problem:

Calculating the number of distinct ways to fill an n × m grid using 1 × 2 and 2 × 1 size tiles. For example, one valid solution for the 4 × 7 grid is and the total number of solutions is 781.

I want to solve this problem through Dynamic Programming. Please help me?

Tags #discussion, #dynamic programing, #recursion, maths

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English hritikkumar 2020-06-14 04:53:05 72
en6 English hritikkumar 2020-06-14 04:52:34 60
en5 English hritikkumar 2020-06-14 04:51:30 60
en4 English hritikkumar 2020-06-14 04:50:49 22
en3 English hritikkumar 2020-06-14 04:49:55 73 Tiny change: ' help me? ' -> ' help me? \n![ ](https://codeforces.com/8a8fbd/tiles.png)'
en2 English hritikkumar 2020-06-14 04:38:01 2 Tiny change: 'roblem: \ncalculating' -> 'roblem: \nCalculating' (published)
en1 English hritikkumar 2020-06-14 04:37:29 321 Initial revision (saved to drafts)