解题思路:动态规划
注意事项:
参考代码:
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])
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题7.2 (C语言代码)浏览:606 |
最小公倍数 (C语言代码)浏览:863 |
出圈】指针malloc版浏览:355 |
C语言程序设计教程(第三版)课后习题11.1 (C语言代码)浏览:486 |
用筛法求之N内的素数。 (C语言代码)浏览:529 |
Tom数 (C语言代码)浏览:552 |
输入输出格式练习 (C语言代码)浏览:845 |
输出九九乘法表 (C语言代码)浏览:1048 |
马拦过河卒 (C语言代码)浏览:1092 |
C语言训练-斐波纳契数列 (C语言代码)浏览:593 |