搜索专题
文章平均质量分 78
Lee丶0767
这个作者很懒,什么都没留下…
展开
-
SDAU 搜索专题 01 求零点
1:问题描述 Problem Description Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try your lucky.Input The first line of the input contain原创 2016-04-05 20:33:35 · 246 阅读 · 0 评论 -
SDAU 搜索专题 19 N皇后问题
1:问题描述 Problem Description 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。Input 共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。Output 共有若干行,每行一个正整数,表示对应输入行的皇原创 2016-04-07 00:31:05 · 283 阅读 · 0 评论 -
SDAU 搜索专题 20 Prime Ring Problem
1:问题描述 Problem Description A 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 pr原创 2016-04-10 16:15:10 · 241 阅读 · 0 评论 -
SDAU 搜索专题 23 Another Eight Puzzle
1:问题描述 Problem Description Fill the following 8 circles with digits 1~8,with each number exactly once . Conntcted circles cannot be filled with two consecutive numbers.There are 17 pairs of connected原创 2016-04-10 16:44:35 · 234 阅读 · 0 评论 -
SDAU 搜索专题 总结
这个专题主要有4个内容。 1:二分法。 找到最大值和最小值,取他们的中点mid。判断mid这个点的值,从而改变左端点或者右端点。一直重复此过程。 2:3分法。 和二分法类似,找到左端点和右端点,取中点mid,然后再根据题意,取mid与右端点或者左端点的中点midmid。判断mid这个点的值,从而改变左端点或者右端点。一直重复此过程。 3:BFS 广度优先搜索。 定义一个优先队列(队列)原创 2016-04-11 08:46:58 · 294 阅读 · 0 评论 -
SDAU 搜索专题 25 推箱子
1:问题描述 Problem Description PusherBoy is an online game http://www.hacker.org/push . There is an R * C grid, and there are piles of blocks on some positions. The goal is to clear the blocks by pushing原创 2016-04-10 16:29:40 · 318 阅读 · 0 评论 -
poj 1564 Sum It Up DFS
题目描述: 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,原创 2016-09-01 19:20:59 · 219 阅读 · 0 评论 -
Mike and Shortcuts (CF bfs)
问题描述: B. Mike and Shortcuts time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Recently, Mike was very busy with studying for exams and cont原创 2016-09-27 15:43:14 · 290 阅读 · 0 评论 -
HDU1253 胜利大逃亡 (3维 BFS)
问题描述:胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33433 Accepted Submission(s): 12347Problem DescriptionIgnatius被魔王抓走原创 2016-09-27 21:00:47 · 233 阅读 · 0 评论 -
FZU 2186 小明迷宫寻宝 (状压Dp+bfs)
问题描述:Problem Description 小明误入迷宫,塞翁失马焉知非福,原来在迷宫中还藏着一些财宝,小明想获得所有的财宝并离开迷宫。因为小明还是学生,还有家庭作业要做,所以他想尽快获得所有财宝并离开迷宫。Input 有多组测试数据。每组数据第一行给出两个正整数n,m(0 < n,m<=100)。代表迷宫的长和宽。接着n行,每行m个整数。正数代表财宝(财宝的个数不超过10);负数代表墙,原创 2016-09-28 19:59:17 · 534 阅读 · 0 评论 -
HDU 2706 key task (3维bfs+状压)
Key TaskTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2082 Accepted Submission(s): 913Problem DescriptionThe Czech Technical Un原创 2016-09-28 22:13:06 · 260 阅读 · 0 评论 -
HDU1026:Ignatius and the Princess I(BFS)
问题描述: Problem Description The 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 laby原创 2016-10-14 23:22:40 · 210 阅读 · 0 评论 -
hdu 1195 Open the Lock(BFS)
问题描述: Problem Description Now 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原创 2016-10-06 23:43:05 · 343 阅读 · 0 评论 -
HDU 2416 Treasure of the Chimp Island (BFS)
问题描述: Problem Description Bob Bennett, the young adventurer, has found the map to the treasure of the Chimp Island, where the ghost zombie pirate LeChimp, the infamous evil pirate of the Caribbeans h原创 2016-10-06 23:53:28 · 214 阅读 · 0 评论 -
HDU 2579 Dating with girls(2) (bfs)
问题描述: Problem Description If you have solved the problem Dating with girls(1).I think you can solve this problem too.This problem is also about dating with girls. Now you are in a maze and the girl y原创 2016-10-07 00:00:54 · 208 阅读 · 0 评论 -
SDAU 搜索专题 18 Tempter of the Bone
1:问题描述 Problem Description 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 sinking原创 2016-04-07 00:26:58 · 210 阅读 · 0 评论 -
SDAU 搜索专题 17 非常可乐
1:问题描述 Problem Description 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐原创 2016-04-07 00:12:03 · 224 阅读 · 0 评论 -
SDAU 搜索专题 02 求极值
1:问题描述 Problem Description Now, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)Can you find the minimum value when x is between 0 and 100.Input The first line of the input co原创 2016-04-05 22:05:59 · 218 阅读 · 0 评论 -
SDAU 搜索专题 03 pie
1:问题描述 Problem Description My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are com原创 2016-04-06 19:50:26 · 221 阅读 · 0 评论 -
SDAU 搜索专题 04 射箭
1:问题描述 Problem Description The recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.We all like tox原创 2016-04-06 20:09:52 · 262 阅读 · 0 评论 -
SDAU 搜索专题 05 转弯问题
1:问题描述 Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to tu原创 2016-04-06 20:16:59 · 268 阅读 · 0 评论 -
SDAU 搜索专题 06 Line belt
1:问题描述 Problem Description In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww’s speed on AB is P and on CD is Q, he can move with the speed R on other area原创 2016-04-06 20:56:32 · 225 阅读 · 0 评论 -
SDAU 搜索专题 07 Cable master
1:问题描述 Problem Description Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contes原创 2016-04-06 21:02:33 · 225 阅读 · 0 评论 -
SDAU 搜索专题 08 猜数字
1:问题描述 Problem Description A有1数m,B来猜.B每猜一次,A就说"太大","太小"或"对了" 。 问B猜n次可以猜到的最大数。 Input 第1行是整数T,表示有T组数据,下面有T行 每行一个整数n (1 ≤ n ≤ 30) Output 猜n次可以猜到的最大数Sample Input 213 Sample Output 17 2:大致题意终于来了一个中文题。原创 2016-04-06 21:16:55 · 249 阅读 · 0 评论 -
SDAU 搜索专题 09 连连看
1:问题描述 Problem Description “连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成原创 2016-04-06 21:32:04 · 212 阅读 · 0 评论 -
SDAU 搜索专题 11 Oil Deposits
1:问题描述 Problem Description 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原创 2016-04-06 23:18:36 · 201 阅读 · 0 评论 -
SDAU 搜索专题 12 Rescue
1:问题描述 Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.原创 2016-04-06 23:25:25 · 221 阅读 · 0 评论 -
SDAU 搜索专题 13 A strange lift
1:问题描述 Problem Description There 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.原创 2016-04-06 23:34:25 · 379 阅读 · 0 评论 -
SDAU 搜索专题 15 Knight Moves
1:问题描述 Problem Description A 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 se原创 2016-04-06 23:42:01 · 206 阅读 · 0 评论 -
SDAU 搜索专题 10 Catch him
1:问题描述 Problem Description 在美式足球中,四分卫负责指挥整只球队的进攻战术和跑位,以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员,而且一般身体都相对比较弱小,所以通常球队会安排5-7名大汉来保护他,其中站在四分卫前方、排成一线的5名球员称为进攻锋线,他们通常都是135公斤左右的壮汉。对防守方来说,攻击对手的四分卫当然是最直接的限制对手进攻的方法。如果效果好,原创 2016-04-06 21:57:50 · 246 阅读 · 0 评论 -
SDAU 搜索专题 16 Red and Black
1:问题描述 Problem Description There 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原创 2016-04-07 00:06:31 · 210 阅读 · 0 评论 -
SDAU 搜索专题 26 Sudoku Killer
1:问题描述 Problem Description 自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。所以全球人民前仆后继,为了奖品日夜训练茶饭不思。当然也包括初学原创 2016-04-10 16:50:15 · 213 阅读 · 0 评论