大洋黑洞-CSDN博客

原创 ACM4-1002

Problem BTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 174 Accepted Submission(s) : 65Problem DescriptionEddy begins to like p

2016-07-07 09:34:34 231

原创 ACM4-1001

Problem ATime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 186 Accepted Submission(s) : 71Problem DescriptionThere are N villages,

2016-07-07 09:20:03 295

原创 ACM-1019

Problem STime Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 2Problem DescriptionBackground Professor Ho

2016-06-30 18:51:17 299

原创 ACM4-1012

Problem LTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 22 Accepted Submission(s) : 11Problem DescriptionThe Gorelians are a wa

2016-06-30 18:47:36 368

原创 ACM4-1009

Problem ITime Limit : 5000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 64 Accepted Submission(s) : 34Problem Description在每年的校赛里，所有进入决赛的同学都会获得一

2016-06-30 18:43:39 398

原创 ACM4-1003

Problem CTime Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 78 Accepted Submission(s) : 41Problem Description某省调查城镇交通状况，得到现有城镇道路统计表

2016-06-18 09:14:26 180

原创 ACM4-1003

Problem CTime Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 78 Accepted Submission(s) : 41Problem Description某省调查城镇交通状况，得到现有城镇道路统计表

2016-06-18 09:04:06 200

原创 ACM3-1007

Problem GTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 137 Accepted Submission(s) : 44Problem Description都说天上不会掉馅饼，但有一天gameboy

2016-05-31 10:05:58 174

原创 ACM3-1010

Problem JTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 134 Accepted Submission(s) : 78Problem Description有一楼梯共M级，刚开始时你在第一级，若每次

2016-05-31 09:14:06 159

原创 ACM3-1014

Problem NTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 98 Accepted Submission(s) : 69Problem Description我们看到过很多直线分割平面的题目，今天的这个

2016-05-30 14:41:29 161

原创 ACM3-1015

Problem OTime Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 98 Accepted Submission(s) : 74Problem DescriptionGive you a number on b

2016-05-30 14:40:27 185

原创 ACM3-1022

Problem VTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 45 Accepted Submission(s) : 20Problem DescriptionThe aspiring Roy the R

2016-05-29 22:56:45 267

原创 ACM3-1013

Problem MTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 137 Accepted Submission(s) : 74Problem Description有一头母牛，它每年年初生一头小母牛。每头小

2016-05-29 22:55:16 246

原创 ACM3-1016

Problem PTime Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 109 Accepted Submission(s) : 67Problem Description在一无限大的二维平面中，我们做如下假设：1

2016-05-29 22:52:07 191

原创 ACM3-1024

Problem XTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 58 Accepted Submission(s) : 31Problem DescriptionRecently, iSea went t

2016-05-28 15:59:02 183

原创 ACM3-1018

Problem RTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 60 Accepted Submission(s) : 29Problem DescriptionBefore ACM can do anyt

2016-05-28 10:20:54 236

原创 ACM3-1005

Problem ETime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 94 Accepted Submission(s) : 50Problem DescriptionA group of researchers

2016-05-28 09:02:14 195

原创 ACM3-1003

Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to

2016-05-28 08:59:13 222

原创 ACM3-1002

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2

2016-05-25 23:12:57 184

原创 ACM3-1006

Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1

2016-05-08 15:57:15 232

原创 ACM2-1023

Problem DescriptionFill 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 cicl

2016-04-24 16:11:38 301

原创 ACM2-1026

Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后，数独这项游戏越来越受到人们的喜爱和重视。据说，在2008北京奥运会上，会将数独列为一个单独的项目进行比赛，冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。所以全球人民前仆后继，为了奖品日夜训练茶饭不思。当然也包括初学者linl

2016-04-24 16:07:47 1606

原创 ACM2-1014

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

2016-04-24 09:52:21 170

原创 ACM2-1019

Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。 Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。 Output共有

2016-04-23 22:47:07 153

原创 ACM2-1016

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

2016-04-23 18:18:53 169

原创 ACM2-1017

Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升可乐的体积为S （S<101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (

2016-04-23 18:13:44 212

原创 ACM2-1013

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

2016-04-23 18:09:14 141

原创 ACM2-1009

Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意见，连线不能从外面绕过去的，但事实上这是错的。现在已经酿成大祸，就只

2016-04-23 18:00:39 487

原创 ACM2-1008

Problem DescriptionA有1数m，B来猜.B每猜一次，A就说"太大"，"太小"或"对了" 。问B猜n次可以猜到的最大数。 Input第1行是整数T,表示有T组数据，下面有T行每行一个整数n (1 ≤ n ≤ 30) Output猜n次可以猜到的最大数

2016-04-23 17:51:15 139

原创 ACM2-1005

Problem 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 a width x, the street he wants to turn to

2016-04-23 17:45:37 169

原创 ACM2-1003

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 are coming t

2016-04-23 17:38:46 150

原创 ACM2-1002

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 fi

2016-04-23 17:35:19 174

原创 ACM2-1001

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 inp

2016-04-23 17:26:25 165

原创 ACM-problem R

problem：A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcel

2016-03-28 14:37:42 216

原创 ACM-problem P

problem：The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will c

2016-03-28 14:35:28 153

原创 ACM-problem G

problem：The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It c

2016-03-28 14:19:13 198

原创 ACM-problem C

problem:Here is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

2016-03-28 14:00:46 213

原创 ACM-problem I

problem：There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some t

2016-03-28 13:57:23 223

原创 ACM-problem B

problem：There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some tim

2016-03-24 09:49:10 198

原创 ACM-problem Q

problem：FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or les

2016-03-21 09:03:45 311

空空如也

空空如也