POJ3050——Hopscotch

Hopscotch Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4004   Accepted: 2660 Description The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes.  They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited).  With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201).  Determine the count of the number of distinct integers that can be created in this manner. Input * Lines 1..5: The grid, five integers per line Output * Line 1: The number of distinct integers that can be constructed Sample Input 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 Sample Output 15 Hint OUTPUT DETAILS:  111111, 111112, 111121, 111211, 111212, 112111, 112121, 121111, 121112, 121211, 121212, 211111, 211121, 212111, and 212121 can be constructed. No other values are possible. Source USACO 2005 November Bronze

题意：

一个5*5的矩阵，从任意位置开始向周围四个方向跳，可以往回跳。求能够组成多少个不同的六位数。

解：

从任意位置出发进行搜索，使用标记数组flag[]标记该数字是否出现过，如果没有出现过则方案数自加。

dfs（int x,int y,int t,int count）x和y代表位置坐标，t代表第几个数字，count代表组成的数字。

#include <stdio.h>
#include <string.h>

int flag[10000005];
int a[5][5];
int num=0;
int dis[4][2]={1,0,0,1,-1,0,0,-1};

void dfs(int x,int y,int t,int count)
{
	if(x<0 || y<0 ||x>=5 ||y>=5)
		return;
	if(t==5)
	{
		if(flag[count]==0)
		{
			num++;
			flag[count]=1;
		}
		return;
	}
	for(int i=0;i<4;i++)
	{
		int newx=x+dis[i][0];
		int newy=y+dis[i][1];
		dfs(newx,newy,t+1,count*10+a[newx][newy]);
	}
}

int main()
{
	for(int i=0;i<5;i++)
	{
		for(int j=0;j<5;j++)
		{
			scanf("%d",&a[i][j]);
		}
	}
	memset(flag,0,sizeof(flag));
	for(int i=0;i<5;i++)
	{
		for(int j=0;j<5;j++)
		{
		
			dfs(i,j,0,a[i][j]);
		}
	}
	
	printf("%d\n",num);
	return 0;
}