-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathRatInMaze.cpp
65 lines (50 loc) · 1.12 KB
/
RatInMaze.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
bool ratInMaze(char maze[10][10], int
soln[][10], int i,int j,int m,int n){
if(i == m and j == n) {
soln[m][n] = 1;
for(int i=0; i <=m; i++){
for(int j =0; j <=n; j++) {
cout<<soln[i][j]<< " ";
}
cout<<endl;
}
cout<<endl;
return true;
}
// Rec case
if(i > m || j >n) return false;
if(maze[i][j] == 'X') return false;
soln[i][j] = 1;
bool rightSide = ratInMaze(maze,soln,
i,j+1,m,n);
bool downSide = ratInMaze(maze,soln,
i+1,j , m, n);
soln[i][j] = 0;
if (rightSide || downSide) return
true;
return false;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
char maze[10][10] = {
"0000",
"00X0",
"000X",
"0X00"
};
int soln[10][10] = {0};
int m = 4, n =4;
bool ans = ratInMaze(maze,soln,0,0,m-1
,n-1);
if(!ans) {
cout<< " path does not exist";
}
return 0;
}