蓝桥杯国赛2018bc++路径计数

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

int dx[4] = { 0,-1,0,1 };
int dy[4] = { 1,0,-1,0 };

int ans = 0;

int m[7][7];
int vis[7][7];

void dfs(int x, int y, int step)
{
	if (step > 11)return;
	
	for (int i = 0; i < 4; i++)
	{
		int a = x + dx[i], b = y + dy[i];
		if (a == 1 && b == 1 && step > 2)
		{
			ans++;
			return;
		}
		if (a > 0 && b > 0 && a < 7 && b < 7)
		{
			
			if (vis[a][b]==0)
			{
				vis[a][b] = 1;
				dfs(a, b, step + 1);
				vis[a][b] = 0;
			}
		}
	}
}



int main()
{
	vis[1][1] = 1;
	dfs(1,1,0);
	
	cout << ans;
	return 0;
}