#include<bits/stdc++.h> using namespace std; int n,m,t,sx,sy,fx,fy,sum; int mp[114][114]; bool vis[114][114]; int dx[4] = {0,0,-1,1}; int dy[4] = {-1,1,0,0}; bool check( int x,int y ){ return x >= 1 && x <= n && y >= 1 && y <= m && vis[x][y] == 0 && mp[x][y] == 0; } void dfs( int x,int y ){ if( x == fx && y == fy ){ sum++; return; } for( int i = 0 ; i < 4 ; i++){ int nx = x + dx[i]; int ny = y + dy[i]; if( check(nx,ny) ){ vis[nx][ny] = 1; dfs(nx,ny); vis[nx][ny] = 0; } } } int main(){ cin >> n >> m >> t; cin >> sx >> sy >> fx >> fy; for( int i = 1 ; i <= t ; i++ ){ int x,y; cin >> x >> y; mp[x][y] = 1; } vis[sx][sy] = 1; if( mp[sx][sy] == 0 ){ dfs(sx,sy); } cout << sum; return 0; } 斜体文本

#include<bits/stdc++.h> using namespace std; int n,m,sx,sy,fx,fy,t; int mp[50][50]; int v[50][50]; int cnt; void dfs(int x,int y){ int nx,ny; if(x == fx and y == fy){ cnt ++; return; } v[x][y] = 1; nx = x-1; ny = y; if(mp[nx][ny] != 1 and v[nx][ny] == 0 and x >= 1 and x <= n and y >= 1 and y <= m) dfs(nx,ny); } int main(){ cin >> n >> m >> t >> sx >> sy >> fx >> fy ; for(int i = 1;i <= t;i ++){ int ax,ay; cin >> ax >> ay; mp[ax][ay] = 1; } dfs(sx,sy); cout << cnt; return 0; }