#include "oestack.h"
#include <iostream> // including library
using namespace std;
#include <string>
class cell // class of cell
{
	int row,column;
	int visited;
	int wallstatus;
	public:
		void addcell(int a,int b,int c) // which row, which column and also is it a wall, save this info.
		{
		  row=a;
		  column=b;
		  wallstatus=c;
		  visited=0;
		}
		void editvisit() //for checking.
		{
			visited=1;
		}
		int checkvisit()
		{
			return visited;
		}
		int checkwall()
		{
			return wallstatus;
		}
		int checkrow()
		{
			return row;
		}
		int checkcolumn()
		{
			return column;
		}
};

class game:public cell
{

	public:
		stack<cell> stackcell; //created a stack type of cell
		cell kop[5][5]; // created an array from cell object
	game()
	{

		int l,z,i;

		for(i=0; i<5; i++) // All cell is visited now, all of them is wall.
		{
			for(int k=0;k<5; k++)
			{
				kop[i][k].addcell(1,1,1);
			}
		}
		cout<<"Enter maze from left to right:"<<endl<<"***"<<endl<<"***"<<endl<<"***"<<endl;
		cout<<"Enter 1 for wall , 0 for gate, but like, 0 enter 1 enter 0 enter ... (nine times)"<<endl; //You should write nine times,I didn't use getch or smt like that so you have to write by one by

		for(int j=1; j<4; j++) //Create 9 cell for maze , for each cell, write it is cell or wall. From left to right
		{
			for(l=1;l<4;l++)
			{
				cin>>z;
				kop[j][l].addcell(l,j,z); //create
			}

		}

		for(i=0; i<5; i++) // write our maze to the screen
		{
			for(int k=0;k<5; k++)
			{
				cout<<kop[i][k].checkwall();
			}
			cout<<endl;
		}
	}


	void find_goal()
	{
		int i=1,k=1,found=0; // i and k is 1 because we start from cell (1,1)
		cell start,back,yaz; // i need three object
		stack<cell> terstenyaz(9); // to write from last :)
		start = kop[i][k]; // start
		kop[i][k].editvisit(); // you visited where you start.
		stackcell.push(start); // put (1,1) (start place) to in your stack
		while (found == 0) // found 0
		{
			if(kop[i][k].checkrow()==3 && kop[i][k].checkcolumn()==3) // if end of the maze
			{
				found =1; // find way to escape
			}

			else if(kop[i][k-1].checkwall() == 0 && kop[i][k-1].checkvisit() != 1) //check left , if not visited then go
			{

				k=k-1;
				kop[i][k].editvisit();
				stackcell.push(kop[i][k]);
			}
			else if(kop[i+1][k].checkwall() == 0 && kop[i+1][k].checkvisit() != 1) //check below , if not visited then go
			{
				i=i+1;
				kop[i][k].editvisit();
				stackcell.push(kop[i][k]);
			}
			else if(kop[i][k+1].checkwall() == 0 && kop[i][k+1].checkvisit() != 1) //check right , if not visited then go
			{
				k=k+1;
				kop[i][k].editvisit();
				stackcell.push(kop[i][k]);
			}
			else if (kop[i][k].checkrow() == 1 && kop[i][k].checkcolumn()== 1) // if you go back to start then there is no escape from maze
				{
				cout<<"No escape from there"<<endl;
				found = 1;
			}
			else if(kop[i-1][k].checkwall() == 0 and kop[i-1][k].checkvisit() == 0) //check up , if not visited then go
			{
				i=i-1;
				kop[i][k].editvisit();
				stackcell.push(kop[i][k]);
			}
			else //if you can not go anywhere , go 1 cell back and check there is another way or not.
			{
				back = stackcell.pop();
				i = back.checkrow();
				k = back.checkcolumn();
			}


		}


		if(found == 1) // escaped
		{

			while(stackcell.isEmpty() != 0) //to write from last to first, maybe recursive functions can be used,but i had no time to use it.
			{
				yaz = stackcell.pop();
				terstenyaz.push(yaz);
			}

			while(terstenyaz.isEmpty() != 0) //write on screen
			{
				yaz=terstenyaz.pop();
				cout<<"("<<yaz.checkcolumn()<<","<<yaz.checkrow()<<")"<<endl;
			}



		}

	}



};
	int main ()
	{
		game a; //call
		a.find_goal();
		getchar();
		getchar();
	}