思路
代码
#include <iostream>
using namespace std;
int map[10][10];
int n,m,t;
int sx,sy,fx,fy;
int ans = 0;
void dfs(int x, int y){
if(x == fx && y == fy){
ans++;
return;
}
if(x-1 >= 1 && map[x-1][y] == 0){
map[x-1][y] = -1;
dfs(x-1,y);
map[x-1][y] = 0;
}
if(x+1 <= n && map[x+1][y] == 0){
map[x+1][y] = -1;
dfs(x+1,y);
map[x+1][y] = 0;
}
if(y-1 >= 1 && map[x][y-1] == 0){
map[x][y-1] = -1;
dfs(x,y-1);
map[x][y-1] = 0;
}
if(y+1 <= m && map[x][y+1] == 0){
map[x][y+1] = -1;
dfs(x,y+1);
map[x][y+1] = 0;
}
}
int main(){
cin >> n >> m >> t;
cin >> sx >> sy;
cin >> fx >> fy;
for(int i = 0; i < t; i++){
int t1,t2;
cin >> t1 >> t2;
map[t1][t2] = 1;
}
map[sx][sy] = -1;
dfs(sx,sy);
cout << ans;
}