一个简单的DFS,遍历到了就ans++,return;
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int vis[10][10];
int n, m,t;//行和列
int sx, sy, fx, fy;//起点和终点
int ans;
int dx[4] = { -1,0,1,0 };//上右下左
int dy[4] = { 0,1,0,-1 };
void dfs(int x1,int y1)
{
if (x1 == fx && y1 == fy)
{
ans++;
return;
}
vis[x1][y1] = 1;
for (int i = 0; i < 4; i++)
{
int tempx = x1 + dx[i];
int tempy = y1 + dy[i];
if (tempx <= n && tempx >= 1 && tempy <= m && tempy >= 1 && vis[tempx][tempy] == 0)
dfs(tempx, tempy);
}
vis[x1][y1] = 0;
}
signed main()
{
cin >> n >> m>>t;
cin >> sx >> sy >> fx >> fy;
for (int i = 1; i <= t; i++)
{
int x1, y1;cin >> x1 >> y1;
vis[x1][y1] = 1;
}
dfs(sx, sy);
cout << ans << endl;
return 0;
}