This code is not working please help

#1

#include<bits/stdc++.h>
using namespace std;
bool rat_in_a_maze(char maze[10][10],int solution[][10],int i,int j,int m,int n)
{
if(i==m && j==n)
{
solution[m][n]=1;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cout<<solution[i][j]<<" ";
cout<<endl;
return true;
}
if(i>m && j>n)
return false;
if(maze[i][j]==‘x’)
return false;
solution[i][j]=1;
bool rightsuccess=rat_in_a_maze(maze,solution,i,j+1,m,n);
bool downsuccess=rat_in_a_maze(maze,solution,i+1,j,m,n);
solution[i][j]=0;
if(rightsuccess || downsuccess)
{
return true;
}
return false;
}
int main()
{
char maze[10][10];
int m=4,n=4;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>maze[i][j];
}
}
int solution[10][10]={0};
bool ans=rat_in_a_maze(maze,solution,0,0,m-1,n-1);
if(!ans)
cout<<“path does not exist”<<endl;

return 0;

}

#2

You can maintain a visited array as, int visited[1000][1000]… and then before traversing, check if you have already visited that path before or not… This should be done to print unique path…

sol[i][j]=1;
visited[i][j]=1;
if(j+1<=M && !visited[i][j+1])
{
bool rightSuccess=ratInmaze(maze,sol,i,j+1,m,n);
if(rightSuccess==true)
{
return true;
}
}
if(i+1<=N && !visited[i+1][j])
{
bool downSuccess=ratInmaze(maze,sol,i+1,j,m,n);
if(downSuccess==true)
{
return true;
}
}