题解 | #走方格的方案数#

这个题难就难在题意，是给你m×n个格子，然后沿着边线走。那其实可走的点的个数是（m+1）×(n+1)个。 这属于动态规划里比较简单的题了，填表格。

while True:
    try:
        m,n = map(int,input().strip().split())
        board = [[1]*(n+1) for i in range(m+1)]
        def count_steps(board,i,j):
            if i !=0 and j != 0:
                board[i][j] = board[i-1][j] + board[i][j-1]
        for i in range(m+1):
            for j in range(n+1):
                count_steps(board,i,j)
        print(board[m][n])
    except:
        break