
搜索
Leslie_Blog
这个作者很懒,什么都没留下…
展开
-
SDUT-2139 图结构练习——BFS——从起始点到目标点的最短步数
图结构练习——BFS——从起始点到目标点的最短步数Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description 在古老的魔兽传说中,有两个军团,一个叫天灾,一个叫近卫。在他们所在的地域,有n个隘口,编号为1..n,某些隘口之间是有通道连接的。其中近卫军团在1号隘口,天灾军团在n号隘口。某一天,...原创 2017-06-01 23:23:59 · 346 阅读 · 0 评论 -
POJ-Find The Multiple
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33514 Accepted: 14053 Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of...原创 2017-08-09 21:14:30 · 248 阅读 · 0 评论 -
POJ-棋盘问题
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49502 Accepted: 23966Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输...原创 2017-08-09 15:23:03 · 400 阅读 · 0 评论 -
POJ-Dungeon Master
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36715 Accepted: 14013DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed o...原创 2017-08-09 19:55:34 · 276 阅读 · 0 评论 -
POJ-3984迷宫问题 (BFS,水题)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24199 Accepted: 14125Description定义一个二维数组: 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...原创 2017-08-10 21:11:18 · 486 阅读 · 0 评论 -
HDU-Oil Deposits (DFS,BFS,水题)
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33294 Accepted Submission(s): 19323Problem DescriptionThe GeoSurvComp geologic su...原创 2017-08-11 14:48:55 · 379 阅读 · 0 评论