码迷,mamicode.com
首页 >  
搜索关键字:the maze makers    ( 598个结果
Right turn
Right turnTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format:%lld Java class name:Mainfrog is trapped in a maze. The maze is infinitely l...
分类:其他好文   时间:2015-10-02 16:04:46    阅读次数:284
HDU-5492 Find a path (枚举+DP)
Problem DescriptionFrog fell into a maze. This maze is a rectangle containing N rows and M columns. Each grid in this maze contains a number, which is...
分类:其他好文   时间:2015-09-28 13:09:02    阅读次数:226
HDU 5492 Find a path DP
Find a pathTime Limit: 1 Sec Memory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=5492DescriptionFrog fell into a maze. This maze is a re...
分类:其他好文   时间:2015-09-27 20:03:46    阅读次数:212
FZU 2150 Fire Game
Description:Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this ...
分类:其他好文   时间:2015-09-27 12:28:27    阅读次数:254
poj 3026 Borg Maze(bfs+prim)
Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:10810Accepted:3574DescriptionThe Borg is an immensely powerful race of enhanced humanoi...
分类:其他好文   时间:2015-09-26 17:09:52    阅读次数:145
poj 2157 Maze(bfs)
题意:有一个迷宫,迷宫里面有5种门,A,B,C,D,E,对应的钥匙分别在迷宫为a,b,c,d,e这些点上,打开这些门分别需要对应的所有钥匙,例如在迷宫里面有A门挡住了去路,那么你需要找到迷宫里所有的a才能打开A门;‘x’表示墙,‘.’表示通道,‘S’表示出发点,‘G’表示终点,可以到达终点输出YES...
分类:其他好文   时间:2015-09-25 18:30:41    阅读次数:143
maze
时限:2000MS内存:65536KB64位IO格式:%I64d & %I64u提交状态练习指定题目版本:问题描述Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which the...
分类:其他好文   时间:2015-09-23 17:01:44    阅读次数:200
C语言(简单游戏)-走出迷宫
1 #include 2 //宏定义 maze[ROWS][COLS];行和列; 3 #define ROWS 7 4 #define COLS 6 5 //绘制迷宫(全局变量) 6 char maze[ROWS][COLS]= { 7 {'#','#','#','#','#','#'}...
分类:编程语言   时间:2015-09-17 01:09:49    阅读次数:214
Backtracking algorithm: rat in maze
Sept. 10, 2015 Study again the back tracking algorithm using recursive solution, rat in maze, a classical problem. Made a few of mistakes through the ...
分类:其他好文   时间:2015-09-14 07:07:16    阅读次数:198
hdu 5335 Walk Out(bfs+寻找路径)
Problem DescriptionIn an n?m maze, the right-bottom corner is the exit (position (n,m) is the exit). In every position of this maze, there is either a...
分类:其他好文   时间:2015-09-11 12:43:46    阅读次数:191
598条   上一页 1 ... 31 32 33 34 35 ... 60 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!