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

import sys


while True:
    try:
        n, m = map(int, input().split())
        dp = [[0] * (m + 1) for _ in range(n + 1)]
        for i in range(n + 1):
            for j in range(m + 1):
                if i == 0:
                    dp[i][j] = 1
                if j == 0:
                    dp[i][j] = 1
                else:
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
        print(dp[n][m])



    except:
        break