🚀 go-pugleaf

#include <iostream.h>
#include <fstream.h>
#include <stdlib.h>

#define PRINTWALL cout<<"1"
#define FALSE 0
#define TRUE (-1)
#define MAX_PATH 120

enum dir_type {N,NE,E,SE,S,SW,W,NW,NONE};

 struct path_stk_type
 {
 unsigned int row,col;
 dir_type dir;
 };

struct move_type
 {
 short int a,b;
 };

int find_path(char *);
void push(path_stk_type,int &,int,int,int);
void pop(path_stk_type,int &,int,int,int);

void main(void)
{
 char maze[22][22];   //read info. 0 and 1
 int  noc,nor,i,j;

 ifstream fobj("indata2.txt",ios::in);
  if(!fobj)
   {
     cout<<"Cannot open the file\n";
     exit(1);
   }

    while(!fobj.eof()) //fobj is your file object
    {
     fobj>>nor;
     fobj>>noc;
     for(i=0;i<noc+2;i++) PRINTWALL;
     cout<<"\n";
     for(i=0;i<nor;i++)
     {
     PRINTWALL;
     for(j=0;j<noc;j++)
      {
      fobj>>maze[i][j];
      cout<<maze[i][j];
      }
     cout<<"1\n";
    }
    for(i=0;i<noc+2;i++) PRINTWALL;
    break;
    }
 } // main

int find_path(char *maze)
  {

      int maze_mark[20][20];
      path_stk_type path_stk[MAX_PATH];
      int stk_top;


     move_type move[NONE];  /* NONE is an enum element */
              /* declared above.         */

     move[N].a=(-1);       move[N].b=0;
     move[NE].a=(-1);      move[NE].b=1;
     move[E].a=0;          move[E].b=1;
     move[SE].a=1;         move[SE].b=1;
     move[S].a=1;          move[S].b=0;
     move[SW].a=1;         move[SW].b=(-1);
     move[W].a=0;          move[W].b=(-1);
     move[NW].a=(-1);      move[NW].b=(-1);


 char path_found=FALSE;
 int cur_row=1, cur_col=1,next_row,next_col;
 dir_type dir=N;
 stk_top=(-1);
 push(*path_stk,stk_top,cur_row,cur_col,dir);
 while(stk_top > (-1) && !path_found)
   {
  pop(*path_stk,stk_top,cur_row,cur_col,dir);
  while(dir <= NW && !path_found)
    {
   next_row=cur_row + move[dir].a;
   next_col=cur_col + move[dir].b;
   if(maze[cur_row][cur_col] == "0")
     {
    path_found=TRUE;
    push(*path_stk,stk_top,cur_row,cur_col,dir);
     } // if
   else if(maze[next_row][next_col]=="0")
     if(maze_mark[cur_row][cur_col]=="0")
     {
      maze_mark[cur_row][cur_col]=="1";
      push(*path_stk,stk_top,row,col,dir+NE)
      cur_row=next_row
      cur_col=next_col
      dir=N;
     } // if
     else
     dir=(dir_type)(dir + NE);
   else
     dir=(dir_type)(dir + NE);
    } // inner while
   } // outer while
 if(!path_found)
  Return 0;
 else
  Return 1;
  }  // find_path


void push(stack,&top,row,col,dir)
 {
 ++top;
 stack[top].row=row;
 stack[top].col=col;
 stack[top].dir=dir;
 } /* push */


void pop(stack,&top,&row,&col,&dir)
 {
 row=stack[top].row;
 col=stack[top].col;
 dir=stack[top].dir;
 --top;
 } /* pop */