| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
Can anyone help me with this 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? 
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
hritikkumar | 2020-06-14 04:53:05 | 72 | ||
| en6 |
|
hritikkumar | 2020-06-14 04:52:34 | 60 | ||
| en5 |
|
hritikkumar | 2020-06-14 04:51:30 | 60 | ||
| en4 |
|
hritikkumar | 2020-06-14 04:50:49 | 22 | ||
| en3 |
|
hritikkumar | 2020-06-14 04:49:55 | 73 | Tiny change: ' help me? ' -> ' help me? \n' | |
| en2 |
|
hritikkumar | 2020-06-14 04:38:01 | 2 | Tiny change: 'roblem: \ncalculating' -> 'roblem: \nCalculating' (published) | |
| en1 |
|
hritikkumar | 2020-06-14 04:37:29 | 321 | Initial revision (saved to drafts) |
