走迷宫问题

一个10*10的迷宫，每一个格子里面存0或者1,0代表可以走，1代表障碍。

输入值：起始坐标

输出值：能否达到设定的目标坐标点（Bool型变量，1或者0）

#include <stdio.h>
#include <stdlib.h>

#define EX 2
#define EY 2
bool findpath = false;
int DX[4]={-1,1,0,0};
int DY[4]={0,0,-1,1};
int maze[10][10]={{0,0,0,1,1,1,1,1,1,1},{1,0,1,1,1,1,1,1,1,1},{1,0,0,1,1,1,1,1,1,1},{1,1,1,1,1,1,1,1,1,1},{0,1,1,0,1,0,0,1,1},{0,1,1,0,1,0,0,1,1},{0,1,1,0,1,0,0,1,1},{0,1,1,0,1,0,0,1,1},{0,1,1,0,1,0,0,1,1},{0,0,0,0,0,0,0,1,1,1}};
int count;

void DFS(int x,int y){
    if(x==EX&&y==EY){
      findpath = true;
      count++;
      return;
    }
    for(int i=0;i<4;i++){
        int NX = x +DX[i];
        int NY = y +DY[i];
        if(NX<=10&&NY<=10&&NX>=0&&NY>=0&&maze[NX][NY]==0)
        {
            int tmp = maze[NX][NY];
            maze[NX][NY] = 2;
            DFS(NX,NY);
            maze[NX][NY] = tmp; 
        }

    }
}

int main(){

    DFS(0,0);
    printf("%d
",findpath);
    printf("%d
",count);
    system("pause");
}