第十一届蓝桥杯决赛（国赛）玩具蛇

思路：从4*4的位置中，对每一个位置都进行dfs，从下面几幅图可以看出当周围的格子都走过的时候为dfs结束条件，这时我们只需要统计走过的格子有多少个就能判断玩具蛇有没有放下。

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

int a[16]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
int dir[4][2] = {1,0,-1,0,0,1,0,-1},res;

void dfs(int x,int y,int book[][4])
{
	int flag = 0;
	for(int i = 0;i < 4;i++)
	{
		int xa = x + dir[i][0];
		int ya = y + dir[i][1];
		if(xa < 0 || ya < 0 || xa == 4 || ya == 4) continue;
		if(book[xa][ya] == 0){
			flag = 1;
			break;
		}
	}
	if(flag == 0)
	{
		int num = 0;
		for(int i = 0;i < 4;i++)
		{
			for(int j = 0;j < 4;j++)
			{
				if(book[i][j] == 1)
				{
					num++;
				}
			}
		}
		if(num == 16)
		{
			res++;
		}
		return ;
	}
	for(int i = 0;i < 4;i++)
	{
		int xa = x + dir[i][0];
		int ya = y + dir[i][1];
		if(xa < 0 || ya < 0 || xa == 4 || ya == 4 || book[xa][ya] == 1) continue;
		book[xa][ya] = 1;
		dfs(xa,ya,book);
		book[xa][ya] = 0;
	}
}

int main(){
	for(int i = 0;i < 4;i++)
	{
		for(int j = 0;j < 4;j++)
		{
			int book[4][4] = {0};
			book[i][j] = 1;
			dfs(i,j,book);
			book[i][j] = 0;
		}
	}
	cout<<res<<endl;
	return 0;
}