P1002

#include<stdio.h>
int X,Y;
int MAP[22][22]={0};//用于表棋盘 0表示可以走的地方，1表示马的控制点
long long BOOK[22][22]={0};
void MARK(int x,int y);
int main()
{
	int x,y;
	scanf("%d%d%d%d",&X,&Y,&x,&y);
	MAP[x][y]=1;
	MARK(x,y);
	int i,j;
	BOOK[0][0]=1;
	if(MAP[0][1]!=1)
	BOOK[0][1]=1;
	if(MAP[1][0]!=1)
	BOOK[1][0]=1;
	for(i=0;i<=X;i++)
	for(j=0;j<=Y;j++)
	{
		if(MAP[i][j]==1)
		continue;
		if(i!=0&&j!=0)
		BOOK[i][j]=BOOK[i-1][j]+BOOK[i][j-1];
		if(i==0&&j!=0)
		BOOK[i][j]=BOOK[i][j-1];
		if(j==0&&i!=0)
		BOOK[i][j]=BOOK[i-1][j];
	}
	printf("%lld",BOOK[X][Y]);
	return 0;
}	

void MARK(int x,int y)
{
	if(x-2>=0&&y-1>=0)
	{
		MAP[x-2][y-1]=1;
	}
	if(x-2>=0&&y+1<=Y)
	{
		MAP[x-2][y+1]=1;
	}
	if(x-1>=0&&y-2>=0)
	{
		MAP[x-1][y-2]=1;
	}
	if(x-1>=0&&y+2<=Y)
	{
		MAP[x-1][y+2]=1;
	}
	if(x+1<=X&&y-2>=0)
	{
		MAP[x+1][y-2]=1;
	}
	if(x+1<=X&&y+2<=Y)
	{
		MAP[x+1][y+2]=1;
	}
	if(x+2<=X&&y-1>=0)
	{
		MAP[x+2][y-1]=1;
	}
	if(x+2<=X&&y+1<=Y)
	{
		MAP[x+2][y+1]=1;
	}
}

这个题用深搜会非常复杂，用递归也会非常复杂（时间、空间都是）

动态规划是最快的

下面是记忆搜索，会比无脑递归快很多，但是依然比不上递推

#include<stdio.h>
int X,Y;
long long count=0;
int MAP[22][22]={0};//用于表棋盘 0表示可以走的地方，1表示马的控制点
long long BOOK[22][22]={0};
void MARK(int x,int y);
long long search(int x,int y);
int main()
{
	int x,y;
	scanf("%d%d%d%d",&X,&Y,&x,&y);
	MAP[x][y]=1;
	MARK(x,y);
	long long m=search(X,Y);
	printf("%lld",m);
	return 0;
}	

void MARK(int x,int y)
{
	if(x-2>=0&&y-1>=0)
	{
		MAP[x-2][y-1]=1;
	}
	if(x-2>=0&&y+1<=Y)
	{
		MAP[x-2][y+1]=1;
	}
	if(x-1>=0&&y-2>=0)
	{
		MAP[x-1][y-2]=1;
	}
	if(x-1>=0&&y+2<=Y)
	{
		MAP[x-1][y+2]=1;
	}
	if(x+1<=X&&y-2>=0)
	{
		MAP[x+1][y-2]=1;
	}
	if(x+1<=X&&y+2<=Y)
	{
		MAP[x+1][y+2]=1;
	}
	if(x+2<=X&&y-1>=0)
	{
		MAP[x+2][y-1]=1;
	}
	if(x+2<=X&&y+1<=Y)
	{
		MAP[x+2][y+1]=1;
	}
}
long long search(int x,int y)
{
/*	printf("x=%d y=%d ",x,y);
	if(x==X&&y==Y)
	{
	count++;
	return;
	}
	if(x==X+1||y==Y+1)
	return;
	if(MAP[x][y]!=1)
	{
		search(x+1,y);
		search(x,y+1);
	}
	else
	return;*/
	if(x==0&&y==0)//结束条件 
{	BOOK[X][Y]=1;
	return 1;
}
	if(x==-1)
	return 0;
	if(y==-1)
	return 0;
	if(MAP[x][y]==1)//这里是马的控制点，标记成为死路 
{
	BOOK[x][y]=0;
	return 0;
}
	if(BOOK[x][y])
	return BOOK[x][y];
	if(MAP[x][y]==0)
	{
	BOOK[x][y]=search(x-1,y)+search(x,y-1);
	return search(x-1,y)+search(x,y-1);
	}
}