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