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

解题思路:
递归或动态规划，f(n,m)=f(m-1,n)+f(m,n-1)

def f(n,m):
    if n==0:
        return 1
    if m==0:
        return 1
    return f(m-1,n)+f(m,n-1)

while 1:
    try:

        n,m = map(int, input().strip().split())
        print(f(n,m))

    except:
        break