![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DFS and BFS
DeDeWo
这个作者很懒,什么都没留下…
展开
-
HDOJ Red and Black
Red and Black http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1001 Time Limit : 2000/1000ms (Java/Other) Memory Limit :原创 2011-09-07 22:53:45 · 604 阅读 · 0 评论 -
Robot Motion
Q - Robot Motion Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description A robot has been programmed to follow the instructions in it原创 2012-03-01 14:51:45 · 673 阅读 · 0 评论 -
Sum It Up
P - Sum It Up Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Given a specified total t and a list of n integers, find all distin原创 2012-03-01 18:21:11 · 820 阅读 · 0 评论 -
胜利大逃亡
G - 胜利大逃亡 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 魔王住在一个城堡里,城堡是一个A*B*C的立方体原创 2012-03-01 14:42:25 · 1010 阅读 · 0 评论 -
How many ways
N - How many ways Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description 这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下: 1.机器原创 2012-03-02 13:02:35 · 841 阅读 · 0 评论 -
Nested Dolls
C - Nested Dolls Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Dilworth is the world’s most prominent collector of Russian nest原创 2012-03-01 14:35:53 · 1091 阅读 · 0 评论 -
A strange lift
B - A strange lift Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description There is a strange lift.The lift can stop can at every floor a原创 2012-03-01 14:29:59 · 790 阅读 · 0 评论 -
A计划
原文:编程笔记 F -A计划 Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u SubmitStatus Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主...原创 2012-03-01 14:38:03 · 1327 阅读 · 0 评论 -
Catch That Cow
A - Catch That Cow Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Farmer John has been informed of the location of a fugitive co原创 2012-03-01 14:24:00 · 837 阅读 · 0 评论 -
用栈和队列实现迷宫求解
用栈实现,深度搜索 #include #include #include using namespace std; struct node{ int x,y,d;//横纵坐标和方向 }; stacks; int path(int map[10][10],int move[8][2]){ node temp; int x,y,d,i,j;原创 2012-02-26 14:25:38 · 3327 阅读 · 0 评论 -
HDOJ Tempter of the Bone
Tempter of the Bone http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1002 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 5原创 2011-09-08 00:49:14 · 1336 阅读 · 0 评论 -
HDOJ N皇后问题
N皇后问题 http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1004 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/3原创 2011-09-08 22:26:53 · 1968 阅读 · 0 评论 -
HDOJ Beat
Beat http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1005 Time Limit : 6000/2000ms (Java/Other) Memory Limit : 32768/32原创 2011-09-09 19:49:08 · 726 阅读 · 0 评论 -
HDOJ Accepted Necklace
Accepted Necklace http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1006 Time Limit : 2000/1000ms (Java/Other) Memory Lim原创 2011-09-09 13:29:20 · 654 阅读 · 0 评论 -
HDOJ 变形课
变形课 http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1008 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65原创 2011-09-09 01:01:25 · 1189 阅读 · 0 评论 -
HDOJ 哈密顿绕行世界问题
哈密顿绕行世界问题 http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=12573&pid=1003 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 327原创 2011-09-08 15:33:33 · 987 阅读 · 0 评论 -
Prime Ring Problem
L - Prime Ring Problem Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description A ring is compose of n circles as shown in diagram. Put na原创 2012-03-01 14:48:21 · 571 阅读 · 0 评论