题目
https://www.luogu.com.cn/problem/P1605
思路
写一个DFS模板
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstdio>
using namespace std;
const int maxn = 7;
int a[maxn][maxn];
int vis[maxn][maxn];
int ans = 0;
int n,m,t;
int x1,y1,x2,y2;
int dist[4][2] = {{1,0},{-1,0},{0,-1},{0,1}};
void dfs(int u, int v){
if(u == x2 && v == y2){
ans++;
return;
}
for(int i=0;i<4;i++){
int xx = u + dist[i][0];
int yy = v + dist[i][1];
if(xx>=1 && xx<=n && yy>=1 && yy<=m && vis[xx][yy] == 0){
vis[xx][yy] = 1;
dfs(xx, yy);
vis[xx][yy] = 0;
}
}
}
int main(){
scanf("%d %d %d",&n, &m, &t);
scanf("%d %d %d %d",&x1, &y1, &x2, &y2);
for(int i=0;i<t;i++){
int x,y;
scanf("%d %d",&x, &y);
vis[x][y] = 2;
}
vis[x1][y1] = 1;
dfs(x1, y1);
cout<<ans<<endl;
return 0;
}