题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
x=list(map(int, x))
n=x[0]
m=x[1]
dp=[[1]*(m+1) for i in range((n+1))]
for i in range(1,(n+1)):
for j in range(1,(m+1)):
dp[i][j]=dp[i][j-1]+dp[i-1][j]
print(dp[-1][-1])