迷宫问题

迷宫问题

Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 39481Accepted: 22058Description定义一个二维数组：

int maze[5][5] = {

0, 1, 0, 0, 0,

0, 1, 0, 1, 0,

0, 0, 0, 0, 0,

0, 1, 1, 1, 0,

0, 0, 0, 1, 0,

};
它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。Input一个5 × 5的二维数组，表示一个迷宫。数据保证有唯一解。Output左上角到右下角的最短路径，格式如样例所示。Sample Input0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0Sample Output(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)Source

#include<stdio.h>
#include<stdlib.h>
typedef struct num{
     int x;
     int y;
}cord;

cord a[25];
int count = 0;
void way( int ar[][7],int x,int y,int flag)
{
                  a[count].x = x;
                  a[count].y = y;
                  count++;
                  int i;
                  if(x == 4 && y == 4) {
                        for(i = 0;i < count;i++)
                        printf("(%d, %d)\n",a[i].x,a[i].y);
                        exit(1);
                        }
                         if(ar[x][y+1] == 0 && flag != 3)   //right
                            way(ar,x,y+1,0);
                        if(ar[x+1][y] == 0 && flag != 2)   //down
                            way(ar,x+1,y,1);
                        if(ar[x-1][y] == 0 && flag != 1)   //up
                            way(ar,x-1,y,2);
                        if(ar[x][y-1] == 0 && flag != 0)   //left
                            way(ar,x,y-1,3);
                        count--;
                        }
 int main(void){
    int maze[7][7];
    int i,j;
    for(i = 0;i < 7;i++)
        for(j = 0;j < 7;j++)
        {
            maze[i][j] = 1;
        }
    for(i = 0;i < 5;i++)
        for(j = 0;j < 5;j++)
          {
              scanf("%d",&maze[i][j]);
          }
    way(maze,0,0,0);
    return 0;
}