随笔分类 -  HDU ACM Steps 5.1

5.1.3 Segment set
摘要:Segment setTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120 Accepted Submission(s): 54 Problem Description A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of... 阅读全文
posted @ 2013-02-15 10:59 cssystem 阅读(265) 评论(0) 推荐(0)
5.1.8 How Many Answers Are Wrong
摘要:How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283 Accepted Submission(s): 134 Problem Description TT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing ... 阅读全文
posted @ 2013-02-15 10:03 cssystem 阅读(183) 评论(0) 推荐(0)
5.1.7 Zjnu Stadium
摘要:Zjnu StadiumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 152 Accepted Submission(s): 65 Problem Description In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a mod... 阅读全文
posted @ 2013-02-15 09:59 cssystem 阅读(152) 评论(0) 推荐(0)
5.1.6 Virtual Friends
摘要:Virtual FriendsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 194 Accepted Submission(s): 62 Problem Description These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends... 阅读全文
posted @ 2013-02-14 18:35 cssystem 阅读(222) 评论(0) 推荐(0)
5.1.5 Junk-Mail Filter
摘要:Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 181 Accepted Submission(s): 62 Problem Description Recognizing junk mails is a tough task. The method used here consists of two steps:1) Extract the common character... 阅读全文
posted @ 2013-02-14 17:35 cssystem 阅读(185) 评论(0) 推荐(0)
5.1.4 Dragon Balls
摘要:Dragon BallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 324 Accepted Submission(s): 154 Problem Description Five hundred years later, the number of dragon balls will increase unexpectedly, so it\\\\\\\'s too difficult for Monk... 阅读全文
posted @ 2013-02-14 12:24 cssystem 阅读(253) 评论(0) 推荐(0)
5.1.2 Is It A Tree?
摘要:Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 480 Accepted Submission(s): 174 Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes con... 阅读全文
posted @ 2013-02-08 12:11 cssystem 阅读(193) 评论(0) 推荐(0)
5.1.1 A Bug's Life
摘要:A Bug's LifeTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 159 Problem Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they featur... 阅读全文
posted @ 2013-02-08 12:07 cssystem 阅读(210) 评论(0) 推荐(0)


点击右上角即可分享
微信分享提示