DP H
H - Grid 1
An obstacle is placed on the grid, the question is how many paths are there from the upper left to the lower right by moving right or down?
routing count
A point on the grid is the domain, and the number of paths to that point is the DP value.
from dynamic programming
DP_H
H:
code:python
def solve(H, W, data):
score = [0 * (W + 1) for i in range(H + 1)]
score01 = 1
for y in range(1, H + 1):
for x in range(1, W + 1):
if datay - 1x - 1 == ord("#"):
scoreyx = 0
else:
scoreyx = (scorey - 1x + scoreyx - 1) % MOD
return scoreHW
---
This page is auto-translated from /nishio/DP H. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.