搜索
ljtlyy
这个作者很懒,什么都没留下…
展开
-
acm 2 1001 二分法
1.10012.Problem DescriptionNow,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.InputThe first line of the原创 2016-04-17 19:47:02 · 348 阅读 · 0 评论 -
acm 2 1012 Rescue
1.10122.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:原创 2016-04-19 17:19:28 · 285 阅读 · 0 评论 -
acm 2 1010 Catch him
1.10102.Problem Description在美式足球中,四分卫负责指挥整只球队的进攻战术和跑位,以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员,而且一般身体都相对比较弱小,所以通常球队会安排5-7名大汉来保护他,其中站在四分卫前方、排成一线的5名球员称为进攻锋线,他们通常都是135公斤左右的壮汉。对防守方来说,攻击对手的四分卫当然是最直接的限制对手进攻的方法原创 2016-04-22 08:15:09 · 320 阅读 · 0 评论 -
acm 2 1011 Oil Deposits
1.10112.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原创 2016-04-22 08:23:19 · 217 阅读 · 0 评论 -
acm 2 1015 Knight Moves
1.1015 骑士跳跃2.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原创 2016-04-22 08:36:04 · 235 阅读 · 0 评论 -
acm 2 1016 Red and Black
1.10162.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 on原创 2016-04-22 08:44:04 · 252 阅读 · 0 评论 -
acm 2 1024 Sequence one
1.10242.Subset sequenceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2339 Accepted Submission(s): 1242Problem DescriptionConsid原创 2016-04-24 19:09:09 · 229 阅读 · 0 评论 -
acm 2 1025 Sequence two
1.10252.Sequence twoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 98 Accepted Submission(s): 46Problem DescriptionSearch is importa原创 2016-04-24 19:23:18 · 337 阅读 · 0 评论 -
acm 2 1026 Sudoku Killer
1.10262.Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。所以全球人民前仆后继,为了奖品日夜训练茶饭不原创 2016-04-24 19:27:54 · 370 阅读 · 0 评论 -
acm 搜索总结
dfs(深搜)深搜,简言之就是不撞南墙不回头顾名思义,深度优先搜索所遵循的策略就是尽可能“深”的在图中进行搜索,对于图中某一个顶点V,如果它还有相邻的顶点(在有向图中就是还有以V为起点的边)且未被访问,则访问此顶点。如果找不到,则返回到上一个顶点。这一过程一直进行直到所有的顶点都被访问为止。 DFS可以搜索出从某一个顶点到另外的一个顶点的所有路径。 由于要进行返回的操作,我们采用的是递归的原创 2016-04-24 19:35:17 · 496 阅读 · 0 评论 -
acm 2 1009 连连看
1.10092.Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现原创 2016-04-19 16:46:12 · 370 阅读 · 0 评论 -
acm 2 1006 Line belt
1.10062.Problem DescriptionIn 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原创 2016-04-19 16:29:04 · 184 阅读 · 0 评论 -
acm 2 1002 二分查找
1.10022.Problem DescriptionNow, 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.InputThe firs原创 2016-04-17 19:57:43 · 362 阅读 · 0 评论 -
acm 2 1003 pie
1.10032.Problem DescriptionMy 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 ar原创 2016-04-17 20:08:33 · 243 阅读 · 0 评论 -
acm 2 1004 Toxophily
1.10042.Problem DescriptionThe recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so o原创 2016-04-17 20:15:37 · 258 阅读 · 0 评论 -
acm 2 1007 Cable master
1.10072.Problem DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest con原创 2016-04-17 20:25:28 · 549 阅读 · 0 评论 -
acm 2 1008 猜数字
1.10082.Problem DescriptionA有1数m,B来猜.B每猜一次,A就说"太大","太小"或"对了" 。问B猜n次可以猜到的最大数。Input第1行是整数T,表示有T组数据,下面有T行每行一个整数n (1 ≤ n ≤ 30)Output猜n次可以猜到的最大数Sample Input2 1 3Sample Output1 73.原创 2016-04-17 20:30:38 · 341 阅读 · 0 评论 -
acm 2 1013 A strange lift
1.10132.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原创 2016-04-18 18:12:54 · 203 阅读 · 0 评论 -
acm 2 1014(同1013) A strange lift
1.10132.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 an原创 2016-04-19 15:58:58 · 232 阅读 · 0 评论 -
acm 2 1017 非常可乐
1.10172.Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以原创 2016-04-19 16:04:51 · 718 阅读 · 0 评论 -
acm 2 1005 Turn the corner
1.10052.Turn the corner: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原创 2016-04-19 16:15:41 · 283 阅读 · 0 评论 -
acm bfs和dfs
搜索算法阶段性总结By 1011shuo BFS与DFS的讨论:BFS:这是一种基于队列这种数据结构的搜索方式,它的特点是由每一个状态可以扩展出许多状态,然后再以此扩展,直到找到目标状态或者队列中头尾指针相遇,即队列中所有状态都已处理完毕。DFS:基于递归的搜索方式,它的特点是由一个状态拓展一个状态,然后不停拓展,直到找到目标或者无法继续拓展结束一个状态的递归。转载 2016-04-24 19:36:06 · 434 阅读 · 0 评论