题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b?tpId=37&tqId=21314&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=2&judgeStatus=undefined&tags=&title=
n, m = map(int, input().split(" "))
dp = [[0 for _ in range(n+1)] for _ in range(m+1)]
dp[0][0] = 1
for i in range(m+1):
dp[i][0] = 1
for j in range(n+1):
dp[0][j] = 1
for i in range(1, m+1, 1):
for j in range(1, n+1, 1):
dp[i][j] = dp[i-1][j] + dp[i][j-1]
print(dp[m][n])
