Skip to content

Solution for Rat-In-Maze problem in C++ #42

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
IIdroyII merged 1 commit into from
Oct 24, 2021
Merged

Solution for Rat-In-Maze problem in C++ #42

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
75 changes: 75 additions & 0 deletions rat_in_maze.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,75 @@
#include<iostream>
using namespace std;

bool isSafe(int** arr, int x, int y, int n){

if( x<n && y<n && arr[x][y]==1) {
return true;
}

return false;
}

bool ratinmaze(int** arr, int x, int y, int n, int** solArr){

if( ( x == (n-1) && y == (n-1) )){
solArr[x][y]=1;
return true;
}

if( isSafe(arr,x,y,n)){

solArr[x][y]=1;

if( ratinmaze(arr,x+1,y,n,solArr) ){
return true;
}
if( ratinmaze(arr,x,y+1,n,solArr) ){
return true;
}

solArr[x][y]=0;
return false;
}

return false;
}


int main(){

int n;
cin>>n;

int** arr = new int*[n];
for(int i=0; i<n; i++){
arr[i] = new int[n];
}

for(int i=0; i<n; i++){
for (int j=0; j<n; j++){
cin>>arr[i][j];
}
}

int** solArr = new int*[n];
for(int i=0; i<n; i++){
solArr[i] = new int[n];
for (int j=0; j<n; j++){
solArr[i][j]=0;
}
}

cout<<endl;

if(ratinmaze(arr,0,0,n,solArr)){
for(int i=0; i<n; i++){
for (int j=0; j<n; j++){
cout<<solArr[i][j]<<" ";
}
cout<<endl;
}
}

return 0;
}