【2019校招真题】方格走法（python）
方格走法_牛客网
https://www.nowcoder.com/practice/56f412b9e17e4504b1bbeca96f94a263?tpId=98&tqId=32876&tPage=3&rp=3&ru=/ta/2019test&qru=/ta/2019test/question-ranking
解题思路
动态规划
完整代码
x, y = map(int, input().split())
dp = [[1 for _ in range(y + 1)] for _ in range(x + 1)]
for i in range(1, x + 1):
for j in range(1, y + 1):
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
print(dp[-1][-1])