
acm_bfs
kongming_acm
kongming_acm
展开
-
全排列的Hash算法
<br />全排列的Hash算法<br />OI 2009-08-28 15:43:39 阅读69 评论0 字号:大中小 订阅<br />我们经常使用的数的进制为“常数进制”,即始终逢p进1。例如,p进制数K可表示为<br />K = a0*p^0 + a1*p^1 + a2*p^2 + ... + an*p^n (其中0 <= ai <= p-1),<br />它可以表示任何一个自然数。<br /><br />对于这种常数进制表示法,以及各种进制之间的转换大家应该是很熟悉的了,但大家可能很少听说变进制原创 2010-08-25 21:53:00 · 980 阅读 · 0 评论 -
1077 Eight 8数码 双向bfs 逆序数哈希
EightTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11025 Accepted: 4850 Special JudgeDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, e原创 2010-08-25 21:52:00 · 810 阅读 · 0 评论 -
1184 聪明的打字员
聪明的打字员Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3409 Accepted: 705<br />Description阿兰是某机密部门的打字员,她现在接到一个任务:需要在一天之内输入几百个长度固定为6的密码。当然,她希望输入的过程中敲击键盘的总次数越少越好。 <br />不幸的是,出于保密的需要,该部门用于输入密码的键盘是特殊设计的,键盘上没有数字键,而只有以下六个键:Swap0, Swap1, Up, Down, Left,原创 2010-08-24 22:50:00 · 739 阅读 · 0 评论 -
1915 Knight Moves 双向bfs
Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13341 Accepted: 5889<br />DescriptionBackground<br />Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Ca原创 2010-08-24 22:52:00 · 514 阅读 · 0 评论 -
hdu 3600 Simple Puzzle 八数码问题有解的条件及其推广
Simple Puzzle<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 207 Accepted Submission(s): 62<br /><br />Problem DescriptionAlpc83 is proud of his IQ, so he usually try to challenge the p原创 2010-09-05 12:10:00 · 1045 阅读 · 0 评论 -
1324 Holedox Moving 贪吃蛇问题
Holedox MovingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7703 Accepted: 1891<br />DescriptionDuring winter, the most hungry and severe time, Holedox sleeps in its lair. When spring comes, Holedox wakes up, moves to the exit of its lair, come原创 2010-09-26 20:03:00 · 634 阅读 · 1 评论 -
tyvj 1143 飘飘乎居士的约会 走迷宫(可穿墙一次)
From VioletHill ☆飘飘乎居士的约会 背景 Background 一阵狂风吹过 只听“pong”的一声,飘飘乎居士降落了!!! 描述 Description 又是美妙的一天,这天飘飘乎居士要和MM约会,因此他打扮的格外帅气。但是,因为打扮的时间花了太久,离约会的时间已经所剩无几。幸运的是,现在飘飘乎居士得到了一张n*m的地图,图中左上角是飘飘乎居士的位置,右下角是约会的地点。‘.’代表马路,‘*’代原创 2010-10-05 14:58:00 · 868 阅读 · 0 评论 -
hdu 3220 Alice’s Cube
Alice’s Cube<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 490 Accepted Submission(s): 161<br /><br />Problem Description<br />Alice has received a hypercube toy as her birthday presen原创 2010-10-03 13:18:00 · 1132 阅读 · 0 评论 -
hdu 3442 Three Kingdoms 优先级队列+BFS
Problem DescriptionThree Kingdoms is a funny game. Often Liu Bei is weak and has to run away,so in the game Liu Bei has a skill called "原创 2011-10-01 15:52:40 · 665 阅读 · 0 评论