求助,开了long long和o2,20分,玄关
查看原帖
求助,开了long long和o2,20分,玄关
778382
wch666楼主2023/12/18 20:16
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y;
struct qi{
	long long ans;
	bool flag=true;
}mapp[25][25];
const int mx[15]={0,-2,-1,1,2,2,1,-1,-2};
const int my[15]={0,1,2,2,1,-1,-2,-2,-1};
int main()
{
	cin>>n>>m>>x>>y;
	n+=2;
	m+=2;
	x+=2;
	y+=2;
	mapp[2][1].ans=1;
	for(int i=0; i<=8; i++)
		mapp[x+mx[i]][x+my[i]].flag=false;
	for(int i=2; i<=n; i++)
		for(int j=2; j<=m; j++)
			if(mapp[i][j].flag)
				mapp[i][j].ans=mapp[i-1][j].ans+mapp[i][j-1].ans;
	cout<<mapp[n][m].ans;
	return 0;
}
2023/12/18 20:16
加载中...