迷宫问题

#include <stdio.h>

typedef struct
{
    char x, y;
}pos;

pos stack[200];
int top = 0;

char map[102][102] = {0};

void push(char a, char b)
{
    stack[top].x = a;
    stack[top++].y = b;
    map[a][b] = 2;//记得剪枝
}

int main()
{
    int m, n, i, j;
    scanf("%d%d",&m, &n);
    for (i=0; i<=m+1; i++)
        for (j=0; j<=n+1; j++)
            if (i*j>0 && i<=m && j<=n)
                scanf("%d",&map[i][j]);
            else
                map[i][j] = 2;
    if (map[1][1] == 1)
    {
        printf("There is no solution!\n");
        return 0;
    }
    push(1,1);
    while (1)
    {
        if (top == 0)
        {
            printf("There is no solution!\n");
            return 0;
        }
        i = stack[top-1].x;
        j = stack[top-1].y;
        if (i==m && j==n)
        {
            break;
        }
        if(map[i+1][j] == 0)
        {
            push(i+1, j);
            continue;
        }
        else if (map[i][j+1] == 0)
        {
            push(i, j+1);
            continue;
        }
        else if (map[i-1][j] == 0)
        {
            push(i-1, j);
            continue;
        }
        else if (map[i][j-1] == 0)
        {
            push(i, j-1);
            continue;
        }
        top --;
    }
    for (i=0; i<top; i++)
    {
        printf("<%d,%d> ",stack[i].x, stack[i].y);
    }
    printf("\n");
    return 0;
}