蓝桥杯2020年第十一届省赛真题-走方格

解题思路:

注意事项:

参考代码:

n,m = map(int,input().split())

dp = [[0 for i in range(m)]for j in range(n)]

for i in range(n):

    for j in range(m):

        if i == j == 0:

            dp[i][j] = 1

        elif (i+1)%2 == (j+1)%2 == 0:

            dp[i][j] = 0

        else:

            dp[i][j]=dp[i-1][j]+dp[i][j-1]

print(dp[-1][-1])