【蓝桥杯】【dp/dfs】走方格

最新推荐文章于 2024-10-02 10:07:45 发布

Diobld

最新推荐文章于 2024-10-02 10:07:45 发布

阅读量344

点赞数

文章标签：深度优先蓝桥杯算法动态规划

本文链接：https://blog.csdn.net/diobld/article/details/123757331

版权

在这里插入图片描述 DFS

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

vis = [[0 for j in range(m)] for i in range(n)]
# martix =[[0 for j in range(m)] for i in range(n)]

ans=0
move=[(0,1),(1,0)]
def dfs(x,y):
    global ans
    if x==n-1 and y == m-1:
        ans+=1 
        return 
    else:
        vis[x][y]=1 
        for i in range(2):
            x_new = x+move[i][0]
            y_new = y+move[i][1]
            if (x_new+1)%2==0 and (y_new+1)%2 ==0:
                continue
            if x_new<n and y_new<m and vis[x_new][y_new] ==0:
                dfs(x_new,y_new)
                vis[x_new][y_new]=0


dfs(0,0)
print(ans)

n,m = map(int,input().strip().split())
dp = [[0 for j in range(m)]for i in range(n) ]

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

for i in range(n):
    for j in range(m):
        if i==0 or j==0:
            dp[i][j] =1 
        elif (i+1)%2 ==0 and (j+1)%2==0:
            dp[i][j] =0 
        else:
            dp[i][j] = dp[i-1][j]+dp[i][j-1]
print(dp[n-1][m-1])