北大暑期课期末 c:马走日

dfs基础题，注意回溯，一开始因为在进入的时候忘了加一个判断条件，输出不了，稍微改了一下以后能输出32我就知道稳了

应该在遍历时候能用数组简化一下代码量

题目链接

#include <iostream>
#include <cstring>
using namespace std;
int n,m,x,y;
int mark[20][20];
int judge()
{
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			if(mark[i][j]==0)
			{
				return 0;
			}
		}
	}
	return 1;
}
int count = 0;
void dfs(int x,int y)
{
	if(judge())
	{
		count ++;
		return ;
	}

	//马有很多跳法
	//1
	if(x+1<n&&y+2<m&&mark[x+1][y+2]!=1)
	{
		mark[x+1][y+2] = 1;
		dfs(x+1,y+2);
		mark[x+1][y+2] = 0;
	}
	if(x+2<n&&y+1<m&&mark[x+2][y+1]!=1)
	{
		mark[x+2][y+1] = 1;
		dfs(x+2,y+1);
		mark[x+2][y+1] = 0;
	}
	
	//2
	if(x-1>=0&&y+2<m&&mark[x-1][y+2] != 1)
	{
		mark[x-1][y+2] = 1;
		dfs(x-1,y+2);
		mark[x-1][y+2] = 0;
	}
	if(x-2>=0&&y+1<m&&mark[x-2][y+1] != 1)
	{
		mark[x-2][y+1] = 1;
		dfs(x-2,y+1);
		mark[x-2][y+1] = 0;
	}
	
	//3
	if(x-1>=0&&y-2>=0&&mark[x-1][y-2] != 1)
	{
		mark[x-1][y-2] = 1;
		dfs(x-1,y-2);
		mark[x-1][y-2] = 0;	
	}
	if(x-2>=0&&y-1>=0&&mark[x-2][y-1] != 1)
	{
		mark[x-2][y-1] = 1;
		dfs(x-2,y-1);
		mark[x-2][y-1] = 0;		
	}
	
	//4
	if(x+1<n&&y-2>=0&&mark[x+1][y-2] != 1)
	{
		mark[x+1][y-2] = 1;
		dfs(x+1,y-2);
		mark[x+1][y-2] = 0;
	}
	if(x+2<n&&y-1>=0&&mark[x+2][y-1] != 1)
	{
		mark[x+2][y-1] = 1;
		dfs(x+2,y-1);
		mark[x+2][y-1] = 0;	
	}
	 
}
int main(void)
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		count = 0;
		memset(mark,0,sizeof(mark));
		scanf("%d%d%d%d",&n,&m,&x,&y);
		mark[x][y] = 1;
		dfs(x,y);
		printf("%d\n",count);
	}
}