搜索
键盘崩坏
这个作者很懒,什么都没留下…
展开
-
HDU1175:连连看(DFS)
Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只原创 2014-05-17 16:25:21 · 532 阅读 · 0 评论 -
HDU1026:Ignatius and the Princess I(BFS+优先队列)
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint原创 2014-07-25 08:44:31 · 276 阅读 · 0 评论 -
HDU3345:War Chess(BFS+优先队列)
Problem DescriptionWar chess is hh's favorite game:In this game, there is an N * M battle map, and every player has his own Moving Val (MV). In each round, every player can move in four directio原创 2014-07-24 21:01:55 · 362 阅读 · 0 评论 -
HDU1226:超级密码(BFS)
Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门原创 2014-07-26 09:58:35 · 386 阅读 · 0 评论 -
POJ3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 46017 Accepted: 14422DescriptionFarmer John has been informed of the location of a fugit原创 2014-07-26 19:49:53 · 313 阅读 · 0 评论 -
POJ2251:Dungeon Master(BFS)
DescriptionYou 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 move one un原创 2014-07-26 20:52:55 · 464 阅读 · 0 评论 -
HDU4707:Pet(DFS)
Problem DescriptionOne day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamste原创 2014-07-27 16:28:23 · 439 阅读 · 0 评论 -
HDU2209:翻纸牌游戏(DFS)
Problem Description有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,纸牌有正反两面,开始的纸牌可能是一种乱的状态(有些朝正,有些朝反),现在你需要整理这些纸牌。但是麻烦的是,每当你翻一张纸牌(由正翻到反,或者有反翻到正)时,他左右两张纸牌(最左边和最右边的纸牌,只会影响附近一张)也必须跟着翻动,现在给你一个乱的状态,问你能否把他们整理好,使得每张纸牌都正面朝上,如果可以原创 2014-07-27 18:34:01 · 622 阅读 · 0 评论 -
HDU1238:Substrings(暴力枚举)
Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of th原创 2014-07-27 10:59:38 · 448 阅读 · 0 评论 -
HDU2181:哈密顿绕行世界问题(DFS)
Problem Description一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output输出从第m个城市出发经过每个城市1次原创 2014-07-29 15:16:11 · 351 阅读 · 0 评论 -
HDU1548:A strange lift( BFS)
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When原创 2014-07-29 16:42:43 · 319 阅读 · 0 评论 -
HDU1195:Open the Lock(BFS)
Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you can add or minus 1 to any原创 2014-07-29 17:31:33 · 297 阅读 · 0 评论 -
POJ1426:Find The Multiple(BFS)
DescriptionGiven 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 not greater tha原创 2014-09-18 12:47:01 · 500 阅读 · 0 评论 -
HDU1495:非常可乐(BFS)
Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S Input三个整数 : S 可乐的体积 ,原创 2014-05-31 10:36:35 · 688 阅读 · 0 评论 -
HDU2660:Accepted Necklace(DFS)
Problem DescriptionI have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each原创 2014-07-25 10:49:39 · 355 阅读 · 0 评论 -
HDU1728:逃离迷宫(BFS)
Problem Description 给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障碍,她必须绕行,从迷宫的一个位置,只能走到与它相邻的4个位置中,当然在行走过程中,gloria不能走到迷宫外面去。令人头痛的是,gloria是个没什么方向感的人,因此,她在行走过程原创 2014-05-31 21:56:53 · 462 阅读 · 0 评论 -
HDU1258:Sum It Up(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],原创 2014-05-24 17:26:35 · 385 阅读 · 0 评论 -
HDU1181:变形课(DFS)
Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一个表,他想让你帮忙计算一下他是否能完成老师的作业,将一个B(原创 2014-05-24 19:57:22 · 464 阅读 · 0 评论 -
HDU1241:Oil Deposits(DFS)
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原创 2014-05-23 23:21:38 · 392 阅读 · 0 评论 -
HDU1312:Red and Black(DFS)
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 adja原创 2014-05-24 11:26:21 · 554 阅读 · 0 评论 -
HDU1518:Square(DFS)
Problem DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square? InputThe first line of input contains N, the number of test ca原创 2014-05-24 10:25:03 · 402 阅读 · 0 评论 -
HDU2952:Counting Sheep(BFS)
#includechar map[110][110];int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};int w,h;void bfs(int x,int y){int xx,yy;for(int i=0;i{xx=x+dir[i][0];yy=y+dir[i][1];if(xx=h||yy>=w||map[xx][y原创 2014-05-24 23:08:55 · 650 阅读 · 0 评论 -
HDU2952:Counting Sheep(DFS)
Problem DescriptionA 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 gone原创 2014-05-24 12:21:51 · 404 阅读 · 0 评论 -
HDU1372:Knight Moves(BFS)
Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of原创 2014-05-25 13:26:50 · 472 阅读 · 0 评论 -
HDU1253:胜利大逃亡(BFS)
Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个原创 2014-05-25 11:19:06 · 362 阅读 · 0 评论 -
HDU2717:Catch That Cow(BFS)
Problem DescriptionFarmer 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 at a原创 2014-05-28 23:30:09 · 515 阅读 · 0 评论 -
HDU1242:Rescue(BFS+优先队列)
Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel.原创 2014-07-23 11:46:09 · 360 阅读 · 0 评论 -
HDU2216:Game III(BFS)
Problem DescriptionZjt and Sara will take part in a game, named Game III. Zjt and Sara will be in a maze, and Zjt must find Sara. There are some strang rules in this maze. If Zjt move a step, Sara原创 2014-07-23 10:37:50 · 365 阅读 · 0 评论 -
HDU1045:Fire Net(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原创 2014-07-24 12:48:11 · 423 阅读 · 0 评论 -
POJ2676:Sudoku(DFS)
DescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1原创 2014-09-20 18:23:15 · 590 阅读 · 0 评论