Check if there is a path in an 8x8 matrix starting in the upper left corner, and ending in the lower right corner
How can i make this condition to this code in cpp?
We have to use the return search
Check if there is a path in an 8x8 matrix starting in the upper left corner, and ending in the lower right corner
#include <iostream>
using namespace std;
#define maxN 20
char m[maxN][maxN];
int n;
bool way = false;
void init(){
int i, j;
do{
cout << "n= ";
cin >> n;
}
while(n<1||n>20);
do{
cout << ":"<<endl;
for (i=0; i<=n-1; i++)
for (j=0; j<=n-1; j++)
cin >> m[i][j];
}
while(m[0][0]!='0');
}
void writelab(){
int k, l;
cout << endl;
for (k=0; k<=n-1; k++){
for (l=0; l<=n-1; l++)
cout << m[k][l] << " ";
cout << endl;
}
}
void Path(int i, int j){
if (i==n-1 && j==n-1){
m[i][j]='*';
way = true;
writelab();
}
else
if (i>=0 && i<=n-1 && j>=0 && j<=n-1)
if(m[i][j] == '0'){
m[i][j]='*';
Path(i+1,j);
Path(i,j+1);
Path(i-1,j);
Path(i,j-1);
m[i][j] = '0';
}
}
int main()
{
init();
Path(0,0);
if(!way) cout << "Nо path";
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
