零分求助

#include<bits/stdc++.h>
using namespace std;
int dp[101][101]={};
int vis[101][101]={0};
int x,y,s,k;
int main(){
	cin>>x>>y>>s>>k;
	x+=1;y+=1;
	s+=1,k+=1;
	vis[s+2][k+2]=1;
	vis[s+4][k+3]=1;
	vis[s+4][k+1]=1;
	vis[s][k+3]=1;
	vis[s][k+1]=1;
	vis[s+3][k+4]=1;
	vis[s+3][k]=1;
	vis[s+1][k+4]=1;
	vis[s+1][k]=1;
	dp[1][1]=0;
	dp[2][1]=1;
	dp[1][2]=1;
	for(int i=1;i<=x;i++){
		for(int j=1;j<=y;j++){
			if(vis[i+3][j+3]!=1){
				dp[i][j]=dp[i-1][j]+dp[i][j-1];
			}
		}
	}
	for(int i=1;i<x;i++){
		for(int j=1;j<y;j++){
			
			cout<<	dp[i][j]<<' ';
			
		}
		cout<<endl;
	}
	cout<<dp[x-1][y-1];
	return 0;
}