-
Notifications
You must be signed in to change notification settings - Fork 0
/
homework3.cpp
77 lines (61 loc) · 1.18 KB
/
homework3.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
66
67
68
69
70
71
72
73
74
75
76
77
#include<iostream>
#include<string>
#include<fstream>
using namespace std;
class Maze
{
char **p;
int row, col, startr, startc, endr, endc;
public:
Maze( ifstream &in )
{
in >> row >> col >> startr >> startc >> endr >> endc;
p = new char * [row];
for( int i = 0; i < row; i++ )
{
p[i] = new char[col];
for( int r = 0; r < col; r++ )
in >> p[i][r];
}
show();
if( !find_path(startr, startc) )
{
cout << "Error! No Path found!!!\n";
}
else
{
cout << endl << endl;
show();
}
}
void show()
{
for( int i = 0; i < row; i++ )
{
for( int c = 0; c < col; c++ )
{
if( p[i][c] == 'x' ) p[i][c] = '0';
cout << p[i][c] << " ";
}
cout << endl;
}
}
bool find_path( int cr, int cc )
{
if( cr < 0 || cr > row - 1 || cc < 0 || cc > col - 1 || p[cr][cc] != '0' )
return false;
p[cr][cc] = 'm';
if( cr == endr && cc == endc )
return true;
if( !find_path( cr - 1, cc ) && !find_path( cr + 1, cc ) && !find_path( cr, cc - 1 ) && !find_path( cr, cc + 1 ) )
return !(p[cr][cc] = 'x');
return true;
}
};
void main()
{
ifstream in("input.txt");
Maze maze( in );
cout << endl;
system("pause");
}