14th test

#include<iostream>

using namespace std;
const int N=1010;
int g[N][N]={
    
{
     1, 1, 1, 1, 1, 1 },
{
     1, 0, 0, 0, 1, 1 },
{
     1, 0, 1, 0, 0, 1 },
{
     1, 0, 0, 0, 1, 1 },
{
     1, 1, 0, 0, 0, 1 },
{
     1, 1, 1, 1, 1, 1 }
};
bool vis[N][N];
struct Node{
    
    int x,y;
}ans[N];
int cnt;
int dis[][2]={
    0,1,1,0,0,-1,-1,0};

bool check(int x,int y){
    
    if(vis[x][y]||g[x][y]==1) return true;
    return false;
}

void dfs(int x,int y,int p){
    
    ans[p]={
    x,y};
    if(x==4&&y==4){
    
        cout<<" Maze path "<<++cnt<<":"<<endl;
        for(int i=1;i<=p;i++){
    
            cout<<'('<<ans[i].x<<','<<ans[i].y<<") ";
        }
        cout<<endl;
        return ;
    }
    for(int i=0;i<4;i++){
    
        int xx=x+dis[i][0];
        int yy=y+dis[i][1];
        if(check(xx,yy)) continue;
        vis[xx][yy]=true;
        dfs(xx,yy,p+1);
        vis[xx][yy]=false;
    }
}

int main(){
    
    cout<<" Maze corresponding adjacency table "<<endl;
    for(int i=0;i<=5;i++){
    
        for(int j=0;j<=5;j++){
    
            cout<<'['<<i<<','<<j<<"]:";
            if(i==0||j==0||i==5||j==5){
    
                cout<<endl;
                continue;
            }
            for(int k=0;k<4;k++){
    
                int xx=i+dis[k][0];
                int yy=j+dis[k][1];
                if(check(xx,yy)) continue;
                cout<<'('<<xx<<','<<yy<<')'<<"\t";
            }
            cout<<endl;

        }
    }
    cout<<" The path of all mazes ："<<endl;
    vis[1][1]=true;
    dfs(1,1,1);
    return 0;
}