DFS
深度优先搜索
DeterminedDiligent
这个作者很懒,什么都没留下…
展开
-
杭电1501 Zipper
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrari原创 2015-06-19 11:38:41 · 403 阅读 · 0 评论 -
最少步数 南阳oj 58【DFS||BFS】
描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,1,0,0,0,0,1 1,1,1,1,1,1原创 2015-08-06 11:20:26 · 447 阅读 · 0 评论 -
Seeding zoj2100 【DFS】
It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There are big stones in some of the squares.Tom has a seeding-machine.原创 2015-08-04 16:13:12 · 731 阅读 · 0 评论 -
N皇后问题 HDU 杭电2553【递归回溯】
Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。Input共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。 Output共有若干行,每行一个正整数原创 2015-08-03 17:45:19 · 981 阅读 · 0 评论 -
变形课 HUD杭电1181 【DFS】
Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一个表,他想让你帮忙计算一下他是否能完成老师的作业,将一个B(原创 2015-08-04 21:18:47 · 513 阅读 · 0 评论 -
杭电1312 Red and Black【递归搜索】
Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjace原创 2015-05-13 22:57:22 · 331 阅读 · 0 评论 -
Oil Deposits HDU杭电1241
Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2015-08-03 19:52:32 · 657 阅读 · 0 评论 -
Prime Ring Problem HDU 杭电1016
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime原创 2015-08-04 10:45:29 · 439 阅读 · 0 评论 -
Fire Net HDU杭电1045【DFS】
Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A block原创 2015-08-13 16:06:21 · 550 阅读 · 0 评论 -
Sum It Up POJ 1564 HDU 杭电1258【DFS】
Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1],原创 2015-08-13 10:30:06 · 957 阅读 · 0 评论 -
组合数 南阳oj32【DFS】
描述找出从自然数1、2、... 、n(0<n<10)中任取r(0<r<=n)个数的所有组合。输入输入n、r。输出按特定顺序输出所有组合。特定顺序:每一个组合中的值从大到小排列,组合之间按逆字典序排列。样例输入5 3样例输出543542541532531521432431421321#include #inc原创 2015-08-10 10:56:39 · 671 阅读 · 0 评论 -
zb的生日 南阳oj325 【DFS】
描述今天是阴历七月初五,acm队员zb的生日。zb正在和C小加、never在武汉集训。他想给这两位兄弟买点什么庆祝生日,经过调查,zb发现C小加和never都很喜欢吃西瓜,而且一吃就是一堆的那种,zb立刻下定决心买了一堆西瓜。当他准备把西瓜送给C小加和never的时候,遇到了一个难题,never和C小加不在一块住,只能把西瓜分成两堆给他们,为了对每个人都公平,他想让两堆的重量之差最小。每个西瓜原创 2015-09-01 12:16:31 · 772 阅读 · 0 评论