上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 22 下一页

2011年9月19日

HDU Knight Moves

摘要: Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 96 Accepted Submission(s): 77 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 th 阅读全文

posted @ 2011-09-19 19:40 NewPanderKing 阅读(3395) 评论(0) 推荐(0) 编辑

2011年9月15日

HDU 1175 连连看

摘要: 连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37 Accepted Submission(s): 24 Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见 阅读全文

posted @ 2011-09-15 10:40 NewPanderKing 阅读(1849) 评论(1) 推荐(0) 编辑

2011年8月27日

hdu Line belt

摘要: Line beltTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 85 Accepted Submission(s): 47Problem 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 mo 阅读全文

posted @ 2011-08-27 12:40 NewPanderKing 阅读(942) 评论(0) 推荐(0) 编辑

2011年8月25日

三分搜索法

摘要: 二分法作为分治中最常见的方法,适用于单调函数,逼近求解某点的值。但当函数是凸性函数时,二分法就无法适用,这时三分法就可以“大显身手”~~ 如图,类似二分的定义Left和Right,mid = (Left + Right) / 2,midmid = (mid + Right) / 2; 如果mid靠近极值点,则Right = midmid;否则(即midmid靠近极值点),则Left = mid;程序模版如下:double Calc(Type a){ /* 根据题目的意思计算 */}void Solve(void){ double Left, Right; double mid, midmid. 阅读全文

posted @ 2011-08-25 21:27 NewPanderKing 阅读(6017) 评论(0) 推荐(5) 编辑

hdu Turn the corner

摘要: Turn the cornerTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 151 Accepted Submission(s): 61Problem DescriptionMr. 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 阅读全文

posted @ 2011-08-25 21:22 NewPanderKing 阅读(1045) 评论(0) 推荐(0) 编辑

hdu 2298 Toxophily

摘要: ToxophilyTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 99 Accepted Submission(s): 56Problem DescriptionThe recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climb 阅读全文

posted @ 2011-08-25 17:46 NewPanderKing 阅读(1165) 评论(0) 推荐(0) 编辑

hdu cup

摘要: CupTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 163 Accepted Submission(s): 57Problem DescriptionThe WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height? T 阅读全文

posted @ 2011-08-25 15:45 NewPanderKing 阅读(483) 评论(0) 推荐(0) 编辑

2011年8月24日

hdu pie

摘要: PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 109 Accepted Submission(s): 52 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 阅读全文

posted @ 2011-08-24 21:48 NewPanderKing 阅读(2276) 评论(0) 推荐(2) 编辑

hdu Strange fuction

摘要: Strange fuctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 108 Accepted Submission(s): 96Problem 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 阅读全文

posted @ 2011-08-24 20:01 NewPanderKing 阅读(1006) 评论(0) 推荐(0) 编辑

hdu Can you solve this equation

摘要: Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 164 Accepted Submission(s): 94Problem 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 you 阅读全文

posted @ 2011-08-24 19:21 NewPanderKing 阅读(434) 评论(0) 推荐(0) 编辑

上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 22 下一页

导航