题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def dp(x, y):
if x == 1 or y == 1:
return 1
else:
return dp(x-1, y) + dp(x, y-1)
n, m = [int(i) for i in input().split()]
print(dp(m+1, n+1))
