![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
文章平均质量分 85
木土的H
这个作者很懒,什么都没留下…
展开
-
HDU--1045--Fire Net--DFS
Fire Net--HDU-1045Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6802 Accepted Submission(s): 3845Problem DescriptionSuppose that we h原创 2014-12-27 09:25:29 · 299 阅读 · 0 评论 -
ACM--steps--4.3.3--蜘蛛牌
蜘蛛牌Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 194 Accepted Submission(s): 89 Problem Description蜘蛛牌是win原创 2015-03-14 08:09:23 · 489 阅读 · 0 评论 -
ACM--steps--4.3.2--Prime Ring Problem
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 497 Accepted Submission(s): 304 Problem Descrip原创 2015-03-13 21:01:04 · 318 阅读 · 0 评论 -
ACM--steps--4.3.1--Tempter of the Bone
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1190 Accepted Submission(s): 390 Problem Descr原创 2015-03-13 18:42:42 · 296 阅读 · 0 评论 -
DFS所用到的奇偶剪枝
什么是奇偶剪枝?把矩阵看成如下形式: 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 从为 0 的格子走一步,必然走向为 1 的格子 。从为 1 的格子走一步,必然走向为 0 的格子 。即: 从 0 走向 1 必然是奇数步,从 0 走向 0 必然是偶数步。所以当遇到从 0 走转载 2015-03-12 21:36:22 · 279 阅读 · 0 评论 -
ACM--steps--4.2.8--Catch him
Catch himTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 173 Accepted Submission(s): 75 Problem Description在美原创 2015-03-12 13:01:49 · 620 阅读 · 0 评论 -
ACM--steps--4.2.4--Knight Moves
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 461 Accepted Submission(s): 331 Problem Description原创 2015-03-10 19:57:58 · 269 阅读 · 0 评论 -
ACM-steps--4.2.6--Find a way
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 159 Accepted Submission(s): 63 Problem DescriptionP原创 2015-03-11 21:10:12 · 455 阅读 · 0 评论 -
ACM--steps--4.2.3--A strange lift
A strange liftTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 717 Accepted Submission(s): 350 Problem Description原创 2015-03-10 07:27:09 · 249 阅读 · 0 评论 -
ACM--steps--4.2.1--Rescue(BFS+priority)
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 932 Accepted Submission(s): 390 Problem DescriptionAnge原创 2015-03-09 19:46:13 · 278 阅读 · 0 评论 -
ACM--steps--4.3.7--Sequence one
Sequence oneTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 271 Accepted Submission(s): 77 Problem Description原创 2015-03-16 20:51:20 · 419 阅读 · 0 评论 -
ACM--steps--4.3.6--N皇后
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 577 Accepted Submission(s): 338 Problem Description在N*N的原创 2015-03-15 17:26:03 · 414 阅读 · 0 评论 -
ACM--steps--4.3.5--Sticks
SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 371 Accepted Submission(s): 120 Problem DescriptionGeor原创 2015-03-15 10:20:46 · 454 阅读 · 0 评论 -
ACM--steps--4.1.3--Pie(二分)
PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 665 Accepted Submission(s): 264 Problem DescriptionMy birthday is原创 2015-02-27 22:02:42 · 320 阅读 · 0 评论 -
HDU--1044--深搜+广搜
Collect More JewelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5006 Accepted Submission(s): 1099Problem DescriptionIt is原创 2014-12-13 12:54:23 · 1663 阅读 · 0 评论 -
ACM--steps--4.3.8--Another Eight Puzzle
Another Eight PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 99 Accepted Submission(s): 71 Problem Descrip原创 2015-03-18 16:32:33 · 370 阅读 · 0 评论