搜索题组

棋盘问题

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input
输入含有多组测试数据。
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <= n
当为-1 -1时表示输入结束。
随后的n行描述了棋盘的形状：每行有n个字符，其中 # 表示棋盘区域， . 表示空白区域（数据保证不出现多余的空白行或者空白列）。
Output
对于每一组数据，给出一行输出，输出摆放的方案数目C （数据保证C<2^31）。
Sample Input

2 1
#.
.#
4 4
...#
..#.
.#..
#...
-1 -1

Sample Output

2
1

#include<iostream>
#include<string>
#include<string.h>
using namespace std;
int num1, num;
char s[1004][1005];
bool sen[1005];
int m, n;
void dfs(int k)
{
	if (num1 == n)
	{
		num++;
		return;
	}
	if (k == m)
	{
		return;
	}
	for (int i = 0; i < m; i++)
	{
		if (s[k][i] == '#' && !sen[i])
		{
			num1++;
			sen[i] = true;
			dfs(k + 1);
			num1--;
			sen[i] = false;
		}
	}
	dfs(k + 1);
}
int main(void)
{
	while (cin >> m >> n)
	{
		if (m == -1 && n == -1)
			return 0;
		num = 0, num1 = 0;
		memset(sen, false, sizeof(sen));
		for (int i = 0; i < m; i++)
			for (int j = 0; j < m; j++)
				cin >> s[i][j];
		dfs(0);
		cout << num << endl;
		
	}
}

############################################

《B - Dungeon Master 》

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.

Is an escape possible? If yes, how long will it take?

Input
The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size).
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a ‘#’ and empty cells are represented by a ‘.’. Your starting position is indicated by ‘S’ and the exit by the letter ‘E’. There’s a single blank line after each level. Input is terminated by three zeroes for L, R and C.
Output
Each maze generates one line of output. If it is possible to reach the exit, print a line of the form

####### Escaped in x minute(s). where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line

Trapped!

Sample Input

3 4 5
S....
.###.
.##..
###.#

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

Sample Output

Escaped in 11 minute(s).
Trapped!

##########################################3

#include<iostream>
#include<string.h>
#include<queue>
using namespace std;
char s[32][32][32];
int key[6];
struct p
{
	int a, b, c;
};
queue<p>q;
int ss[32][32][32];
int m, n, k;
int dx[6] = { 1,-1,0,0,0,0 }, dy[6] = { 0,0,1,-1,0,0 }, dz[6] = { 0,0,0,0,-1,1 };
void dfs(int x, int y, int z)
{
	q.push({ x,y,z });
	while (q.size())
	{
		p t = q.front();
		q.pop();
		for (int i = 0; i < 6; i++)
		{
			int xx = t.a+dx[i], yy = t.b+dy[i], zz = t.c+dz[i];
			if (ss[xx][yy][zz] == 0 && s[xx][yy][zz] != '#'&&xx < m&&xx >= 0 && yy >= 0 && yy < n&&zz >= 0 && zz < k)
			{
				q.push({ xx,yy,zz });
				ss[xx][yy][zz] = ss[t.a][t.b][t.c] + 1;
			}
		}
	}
}
int main(void)
{
	
	while (cin >> k >> m >> n)
	{
		if (!k && !m && !n)
			return 0;
		memset(ss, 0, sizeof(ss));
		for (int i = 0; i < k; i++)
			for(int j=0;j<m;j++)
				for (int kk = 0; kk < n; kk++)
				{
					cin >> s[j][kk][i];
					if (s[j][kk][i] == 'S')
					{
						key[0] = j, key[1] = kk, key[2] = i;
					}
					if (s[j][kk][i] == 'E')
					{
						key[3] = j, key[4] = kk, key[5] = i;
					}
				}
		dfs(key[0], key[1], key[2]);
		if (ss[key[3]][key[4]][key[5]] == 0)
			cout << "Trapped!" << endl;
		else
			cout <<"Escaped in "<< ss[key[3]][key[4]][key[5]] <<" minute(s)."<< endl;
		
		
	}
}

####### Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

* Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
* Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input

5 17

Sample Output

4

Hint
The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.
#######################################

` A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Each stack may contain chips of several different colors.

The actual shuffle operation is performed by interleaving a chip from S1 with a chip from S2 as shown below for C = 5:

The single resultant stack, S12, contains 2 * C chips. The bottommost chip of S12 is the bottommost chip from S2. On top of that chip, is the bottommost chip from S1. The interleaving process continues taking the 2nd chip from the bottom of S2 and placing that on S12, followed by the 2nd chip from the bottom of S1 and so on until the topmost chip from S1 is placed on top of S12.

After the shuffle operation, S12 is split into 2 new stacks by taking the bottommost C chips from S12 to form a new S1 and the topmost C chips from S12 to form a new S2. The shuffle operation may then be repeated to form a new S12.

For this problem, you will write a program to determine if a particular resultant stack S12 can be formed by shuffling two stacks some number of times.

Input

The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.

Each dataset consists of four lines of input. The first line of a dataset specifies an integer C, (1 ≤ C ≤ 100) which is the number of chips in each initial stack (S1 and S2). The second line of each dataset specifies the colors of each of the C chips in stack S1, starting with the bottommost chip. The third line of each dataset specifies the colors of each of the C chips in stack S2 starting with the bottommost chip. Colors are expressed as a single uppercase letter (A through H). There are no blanks or separators between the chip colors. The fourth line of each dataset contains 2 * C uppercase letters (A through H), representing the colors of the desired result of the shuffling of S1 and S2 zero or more times. The bottommost chip’s color is specified first.

Output

Output for each dataset consists of a single line that displays the dataset number (1 though N), a space, and an integer value which is the minimum number of shuffle operations required to get the desired resultant stack. If the desired result can not be reached using the input for the dataset, display the value negative 1 (−1) for the number of shuffle operations.

Sample Input

2
4
AHAH
HAHA
HHAAAAHH
3
CDE
CDE
EEDDCC

Sample Output

1 2
2 -1

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

int main()
{
    int n,c,i;
    int t = 0;
    cin >> n;
    while(++t <= n)
    {
        cin >> c;
        char s1[205];
        char s2[205];
        char s[410];
        cin >> s1 >> s2 >> s;
        
        map<string,bool>vist;
        vist[s] = true;
        
        int step = 0;
        while(1){
            char str[410];
            int ps = 0;
            for(i = 0; i < c; i ++){
                str[ps++] = s2[i];
                str[ps++] = s1[i];
            }
            str[ps] = '\0';
            
            step ++;
            
            if(!strcmp(str,s)){
                cout << t << " " << step << endl;
                break;
            }
            else if(vist[str] && strcmp(str,s)){
                cout << t << " " << -1 <<endl;
            }
            
            vist[str] = true;
            
            for(i = 0; i < c; i++){
                s1[i] = str[i];
            }
            s1[i] = '\0';
            
            for(int k = 0; i < 2*c;k ++, i ++){
                s2[k] = str[i];
            }
            s2[k] = '\0';
        }
    }
    return 0;
}

################################3

####### 定义一个二维数组：

int maze[5][5] = {

	0, 1, 0, 0, 0,

	0, 1, 0, 1, 0,

	0, 0, 0, 0, 0,

	0, 1, 1, 1, 0,

	0, 0, 0, 1, 0,

};

它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。
Input
一个5 × 5的二维数组，表示一个迷宫。数据保证有唯一解。
Output
左上角到右下角的最短路径，格式如样例所示。
Sample Input

0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0

Sample Output

(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)

########
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.
Input
The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either *', representing the absence of oil, or@’, representing an oil pocket.
Output
For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.
Sample Input

1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5 
****@
*@@*@
*@**@
@@@*@
@@**@
0 0 

Sample Output

0
1
2
2

######################3
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.
Input
The input contains multiple test cases.
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’ express Merceki initial position.
‘#’ forbid road;
‘.’ Road.
‘@’ KCF
Output
For each test case output the minimum total time that both yifenfei and Merceki to arrival one of KFC.You may sure there is always have a KFC that can let them meet.
Sample Input

4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#

Sample Output

66
88
66