Description

如图所示，迷宫的入口为（1,1），出口为（8,8）。用队列求迷宫

int main(){
int ma[111][111]={//设置迷宫数组
{1,1,1,1,1,1,1,1,1,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,0,0,1,1,0,0,1},
{1,0,1,1,1,0,0,0,0,1},
{1,0,0,0,1,0,0,0,0,1},
{1,0,1,0,0,0,1,0,0,1},
{1,0,1,1,1,0,1,1,0,1},
{1,1,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}
};
Node start,t;//start入口点（1,1），t队头接头 
int xe=8;
int ye=8;//出口点（8,8） 
start.x=1;
start.y=1;
start.pre=-1;//起始点的前驱点记为-1 

Input Format

无输入

Output Format

1 1
2 1
3 1
4 1
5 1
5 2
5 3
6 3
6 4
6 5
7 5
8 5
8 6
8 7
8 8

Hint

正确输出;

1 1
2 1
3 1
4 1
5 1
5 2
5 3
6 3
6 4
6 5
7 5
8 5
8 6
8 7
8 8

Source