bfs&&dfs
文章平均质量分 82
elbadaernu
这个作者很懒,什么都没留下…
展开
-
POJ 3414 Pots
POJ 3414 Pots题目描述 You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:1.FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;2原创 2017-02-07 16:03:49 · 659 阅读 · 0 评论 -
Party Lamps POJ - 1176
Dreamoon and WiFi CodeForces - 476B阿斯达所原创 2017-02-14 12:50:05 · 359 阅读 · 0 评论 -
Image Perimeters POJ - 1111
Image Perimeters POJ - 1111题目描述Technicians in a pathology lab analyze digitized images of slides. Objects on a slide are selected for analysis by a mouse click on the object. The perimeter of the bound原创 2017-02-02 10:26:45 · 491 阅读 · 0 评论 -
Oil Deposits POJ - 1562
Oil Deposits POJ - 1562题目描述 The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and cr原创 2017-02-02 11:06:40 · 441 阅读 · 0 评论 -
fzu 2150 Fire Game
题目描述 Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they原创 2017-03-30 21:47:53 · 363 阅读 · 0 评论 -
Prime Path POJ - 3126
Prime Path POJ - 3126题目描述 The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their office原创 2017-04-01 20:44:17 · 437 阅读 · 0 评论 -
UVA11624 Fire!
UVA11624 Fire!题目描述Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s原创 2017-02-16 21:03:34 · 815 阅读 · 0 评论 -
The Same Game POJ - 1027(搜索+模拟)
The game named “Same” is a single person game played on a 10 \Theta 15 board. Each square contains a ball colored red (R), green (G), or blue (B). Two balls belong to the same cluster if they have the原创 2017-08-25 14:08:38 · 494 阅读 · 0 评论 -
Sticks POJ - 1011 (暴力dfs+剪枝)
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had origi原创 2017-08-26 14:07:52 · 340 阅读 · 0 评论 -
Black And White HDU - 5113 (dfs+剪枝)
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors ar原创 2017-09-05 21:25:35 · 232 阅读 · 0 评论 -
The Labyrinth CodeForces - 616C
The Labyrinth CodeForces - 616C题目描述 You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with ‘.’, impassable cell原创 2017-02-13 19:25:55 · 345 阅读 · 0 评论 -
Nightmare HDU - 1072
Nightmare HDU - 1072题目描述 Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bo原创 2017-02-12 11:36:02 · 260 阅读 · 0 评论 -
POJ1426 Find The Multiple
POJ1426 Find The Multiple题目描述 Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is原创 2017-02-07 19:51:34 · 303 阅读 · 0 评论 -
POJ2251:Dungeon Master
POJ2251:Dungeon Master题目描述 You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to原创 2017-02-07 20:34:41 · 286 阅读 · 0 评论 -
POJ 1321-棋盘问题
POJ 1321-棋盘问题题目描述在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input 输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8原创 2017-02-07 21:38:48 · 296 阅读 · 0 评论 -
HDU1728 逃离迷宫
HDU1728 逃离迷宫题目描述 给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障碍,她必须绕行,从迷宫的一个位置,只能走到与它相邻的4个位置中,当然在行走过程中,gloria不能走到迷宫外面去。令人头痛的是,gloria是个没什么方向感的人,因此,她在行走过程中,不能转太多弯原创 2017-02-08 18:57:24 · 587 阅读 · 0 评论 -
HDU1495:非常可乐
HDU1495:非常可乐题目描述 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且原创 2017-02-17 21:32:44 · 378 阅读 · 0 评论 -
HDU2612 Find a way
HDU2612 Find a way题目描述 Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifen原创 2017-02-17 21:50:00 · 288 阅读 · 0 评论 -
HDU 1175 连连看
HDU 1175 连连看题目描述 “连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只能将错就错了原创 2017-02-17 21:57:27 · 235 阅读 · 0 评论 -
hdu2952 Counting Sheep
hdu2952 Counting Sheep题目描述 A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I’d原创 2017-02-17 22:12:42 · 316 阅读 · 0 评论 -
Catch That Cow POJ - 3278
Catch That Cow POJ - 3278题目描述Farmer 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 cow is原创 2017-02-06 20:49:37 · 284 阅读 · 0 评论 -
HDU1010 Tempter of the Bone
HDU1010 Tempter of the Bone题目描述 The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground原创 2017-02-08 13:18:04 · 248 阅读 · 0 评论 -
滑雪 POJ - 1088 (记忆化搜索)
Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9一原创 2017-08-29 21:45:24 · 313 阅读 · 0 评论