DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the dog...
分类：
其他好文 时间：
2015-08-06 12:56:02
阅读次数：
130
迷宫问题Description定义一个二维数组： 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表示可以走的路，只能横着...
分类：
其他好文 时间：
2015-08-05 21:57:19
阅读次数：
319
迷宫问题
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 11189
Accepted: 6698
Description
定义一个二维数组：
int maze[5][5] = {
0, 1, 0, 0, 0,
0, 1, 0, 1, 0,
0,...
分类：
其他好文 时间：
2015-08-05 20:27:36
阅读次数：
147
hdu 1010 的传送门The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized th...
分类：
其他好文 时间：
2015-08-05 16:28:39
阅读次数：
88
Problem DescriptionIn ann?mmaze, the right-bottom corner is the exit (position(n,m)is the exit). In every position of this maze, there is either a0or ...
分类：
其他好文 时间：
2015-08-04 22:35:59
阅读次数：
221
DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the dog...
分类：
其他好文 时间：
2015-08-02 18:13:13
阅读次数：
81
题目传送门 1 /* 2 DFS：因为一行或一列都只放一个，可以枚举从哪一行开始放，DFS放棋子，同一列只能有一个 3 */ 4 #include 5 #include 6 #include 7 using namespace std; 8 9 char maze[10][10];1...
分类：
其他好文 时间：
2015-08-02 15:02:06
阅读次数：
106
Walk Out
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2534 Accepted Submission(s): 494
Problem Description
In an n?m maze,
...
分类：
其他好文 时间：
2015-08-01 19:03:30
阅读次数：
126
Walk Out
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2469 Accepted Submission(s): 485
Problem Description
In an n?m maze,
...
分类：
其他好文 时间：
2015-08-01 17:24:04
阅读次数：
171
Problem DescriptionIn ann?mmaze, the right-bottom corner is the exit (position(n,m)is the exit). In every position of this maze, there is either a0or ...
分类：
其他好文 时间：
2015-08-01 15:40:13
阅读次数：
180
