BFS&&DFS
hitol
SDUT
展开
-
SDUT-2780--Pots
Pots题目描述You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP原创 2014-08-03 21:06:12 · 626 阅读 · 0 评论 -
HDU 1253 胜利大逃亡(BFS)
胜利大逃亡Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1253DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡原创 2014-08-02 20:12:13 · 574 阅读 · 0 评论 -
POJ-3026-Borg Maze(BFS+ Prime)
Borg MazeDescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group conscious原创 2014-08-16 21:08:06 · 448 阅读 · 0 评论 -
The die is cast (DFS 双重)
The die is cast InterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted the原创 2014-08-16 19:13:48 · 620 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That CowDescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the c原创 2014-06-13 17:27:15 · 592 阅读 · 0 评论 -
SDUT-2141-数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历
数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历题目描述给定一个无向连通图,顶点编号从0到n-1,用广度优先搜索(BFS)遍历,输出从某个顶点出发的遍历序列。(同一个结点的同层邻接点,节点编号小的优先遍历)输入输入第一行为整数n(0对于每组数据,第一行是三个整数k,m,t(0<k<100,0<m<(k-1)*k/2,0< t<k),表示有m条边,k个顶点,原创 2014-08-18 16:26:32 · 752 阅读 · 0 评论