编写题解 1266: 马拦过河卒

解题思路:动态规划

注意事项:

参考代码:

a, b, c, d = map(int, input().split())
stop_point = [(0, 0), (-1, -2), (1, -2), (-1, 2), (1, 2), (2, 1), (2, -1), (-2, 1), (-2, -1)]

result = [[0 for _ in range(30)] for _ in range(30)]
bool_point = [[0 for _ in range(30)] for _ in range(30)]
result[2][1] = 1

a += 2
b += 2
c += 2
d += 2

for dx,dy in stop_point:
   bool_point[c + dx][d + dy] = 1

for i in range(2, a + 1):
   for j in range(2, b + 1):
       if bool_point[i][j]:
           continue
       else:
           result[i][j] = result[i - 1][j] + result[i][j - 1]

print(result[a][b])