SDUT - 2449 数据结构实验之栈与队列十：走迷宫

#include <stdio.h>
#include <stdlib.h>
int a[15][15], dp[15][15], m, n, ans;
void dfs(int x, int y)
{
    if(x == n && y == m){ans++; return ;}
    dp[x][y] = 1;
    if(x - 1 > 0 && a[x - 1][y] == 0 && dp[x - 1][y] == 0)dfs(x-1, y);
    if(x + 1 <= n && a[x + 1][y] == 0 && dp[x + 1][y] == 0)dfs(x+1, y);
    if(y - 1 > 0 && a[x][y - 1] == 0 && dp[x][y - 1] == 0)dfs(x, y-1);
    if(y + 1 <= m && a[x][y + 1] == 0 && dp[x][y + 1] == 0)dfs(x, y+1);
    dp[x][y] = 0;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%d", &a[i][j]);
            }
        }
        ans = 0;
        dfs(1,1);
        printf("%d\n", ans);
    }
    return 0;
}