1.c

运用C语言实现寻找输入的“迷宫”矩阵中的可选路径

#include "math.h"
#include "stdio.h"
int maze[14][17]={7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,    
				  7,0,1,0,0,0,1,1,0,0,0,1,1,1,1,1,7,
				  7,1,0,0,0,1,1,0,1,1,1,0,0,1,1,1,7,
				  7,0,1,1,0,0,0,0,1,1,1,1,0,0,1,1,7,
			      7,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,7,
				  7,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,7,
			      7,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,7,
			      7,0,0,1,1,0,1,1,1,0,1,0,0,1,1,1,7,
			      7,0,1,1,1,1,0,0,1,1,1,1,1,1,1,1,7,
			      7,0,0,1,1,0,1,1,0,1,1,1,1,1,0,1,7,
			      7,1,1,0,0,0,1,1,0,1,1,0,0,0,0,0,7,
			      7,0,0,1,1,1,1,1,0,0,0,1,1,1,1,0,7,
			      7,0,1,0,0,1,1,1,1,1,0,1,1,1,1,0,7,
			      7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,};   
int move[3][9]={0,0,0,0,0,0,0,0,0,       
				0,0,1,1,1,0,-1,-1,-1,
				0,1,1,0,-1,-1,-1,0,1};    
int flag=0,step=0,x[100],y[100];

main()
{  void output();  
	void next(int,int,int);
	next(2,2,2);                     
}

void next(int i,int j,int d)
{	int k,ni,nj;
	maze[i][j]=8;                   
	step++;                         
	x[step]=i;y[step]=j;            
	if(i==12&&j==15)               
		{flag=1;                    
		 printf("THE RESULT IS:\n");
		 for(k=1;k<=step;k++)       
			{if(k%4==0) printf("\n");
			 printf("第%d步(%d,%d)-->  ",k,x[k],y[k]);}
		 printf("\n\n");               
		 output();                   
		 return;}
	else
		for(k=1;k<9&&!flag;k++)      
			{ni=i+move[1][k];    
			 nj=j+move[2][k];
			 if( maze[ni][nj]==0)       
				next(ni,nj,k);}
	maze[i][j]=3;       
	step--;             
	return;}            

void output()
{	int i,j;
	maze[1][1]=8;
	for(i=1;i<13;i++)
		{for(j=1;j<16;j++)
			{if(maze[i][j]==3) maze[i][j]=0;
			printf("%d ",maze[i][j]);}
		 printf("\n");}  
}