P1002 [NOIP2002 普及组] 过河卒

#include<bits/stdc++.h>
using namespace std;
int m,n,a,b;
int ma[22][22],map1[22][22];
void bj(int x,int y)
{
	
	map1[x][y] = 1;
	map1[x-1][y-2] = 1;
	map1[x-2][y-1] = 1;
	map1[x+1][y-2] = 1;
	map1[x-2][y+1] = 1;
	map1[x-1][y+2] = 1;
	map1[x+2][y-1] = 1;
	map1[x+1][y+2] = 1;
	map1[x+2][y+1] = 1;
}
int main()
{
	cin>>n>>m>>a>>b;
	bj(a,b);
	ma[0][1] = 1;
	for(int i=1;i<=n+1;i++)
		for (int j=1;j<=m+1;j++)
		{
			ma[i][j] = ma[i-1][j]+ma[i][j-1];
			if(map1[i-1][j-1]) ma[i][j] = 0;
		}
	
	cout<<ma[n+1][m+1];
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[1000][1000];
int main()
{
	int bx,by,mx,my;
	cin>>bx>>by>>mx>>my;
	memset(a,0,sizeof(a));
	bx+=2;
	by+=2;
	mx+=2;
	my+=2;
	for(int i=2;i<=bx;i++)
		for(int j=2;j<=by;j++)
		{
			//处理越界 
			if(i==0||i==1||i==bx+1||i==bx+2||j==0||j==1||j==by+1||j==by+2)
			{
				a[i][j] = -1;
			}
		}
	a[mx][my] = -1;
	a[mx+1][my+2] = -1;
	a[mx+1][my-2] = -1;
	a[mx-1][my+2] = -1;
	a[mx-1][my-2] = -1;
	a[mx+2][my+1] = -1;
	a[mx+2][my-1] = -1;
	a[mx-2][my+1] = -1;
	a[mx-2][my-1] = -1;
	
	for(int i=2;i<=bx;i++)
		for(int j=2;j<=by;j++)
		{
			if(i==2&&j==2)
			{
				a[2][2]=1;
				continue;
			}
			if(a[i][j]<0)	continue;
			if(a[i][j-1]>0)	a[i][j]+=a[i][j-1];
			if(a[i-1][j]>0) a[i][j]+=a[i-1][j];	
		}
	cout<<a[bx][by];
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int a[100][100];//储存路径
bool b[100][100];//判断是否走过 

int fx[9] = {0,-1,-1,-2,-2,1,1,2,2};
int fy[9] = {0,-2,2,-1,1,-2,2,-1,1};
int main()
{
	int bx,by,mx,my;
	cin>>bx>>by>>mx>>my;
	bx+=2;//防止"马"越界 
	by+=2;	
	mx+=2;
	my+=2;
	for(int i=0;i<9;i++)  b[mx+fx[i]][my+fy[i]] = 1;//1表示路障 
	for(int i=2;i<=bx;i++)
		for(int j=2;j<=by;j++)
		{
			if(i==2&&j==2)
			{
				a[2][2]=1; //起始1条路线 
				continue;
			}
			if(b[i][j])
				continue;
			a[i][j] = a[i][j-1]+a[i-1][j]; 
		}
	cout<<a[bx][by];
	
	return 0;
}