From 5d70b380e3b37522b4fbe31fffcf76307afa1c86 Mon Sep 17 00:00:00 2001
From: VikasArsul <92970538+VikasArsul@users.noreply.github.com>
Date: Fri, 22 Oct 2021 11:28:25 +0530
Subject: [PATCH] Solution for Rat-In-Maze problem in C++

---
 rat_in_maze.cpp | 75 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 rat_in_maze.cpp

diff --git a/rat_in_maze.cpp b/rat_in_maze.cpp
new file mode 100644
index 0000000..808a791
--- /dev/null
+++ b/rat_in_maze.cpp
@@ -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;
+}
\ No newline at end of file