Number of paths in a grid 2
Given a grid of height
w, you are asked to calculate the number of unique paths one can take to move from the top-left corner to the bottom-right corner. You’re only allowed to move right, down, and diagonally in the bottom-right direction.
The input contains two integers
w(1 ≤ h, w ≤ 100).
The program should print the number of unique paths it’s possible to take from the top-left to the bottom-right corner of the grid. The output can be large, so the answer should be taken modulo .
Time limit: 1 seconds
Memory limit: 512 MB
Output limit: 1 MB