摘要： Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 833Accepted Submission(s): 280Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: T 阅读全文

摘要： Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5851Accepted Submission(s): 2631Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 100 阅读全文

摘要： StarsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 628Accepted Submission(s): 268Problem DescriptionYifenfei is a romantic guy and he likes to count the stars in the sky.To make the problem easier,we considerate the sky is a two-dimension plane.S 阅读全文

摘要： See you~Time Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2023Accepted Submission(s): 645Problem DescriptionNow I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good 阅读全文

摘要： King Arthur's KnightsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 525Accepted Submission(s): 111Special JudgeProblem DescriptionI am the bone of my sword. Steel is my body, and the fire is my blood.- from Fate / Stay NightYou must have known 阅读全文

摘要： TroubleTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2284Accepted Submission(s): 726Problem DescriptionHassan is in trouble. His mathematics teacher has given him a very difficult problem called 5-sum. Please help him.The 5-sum problem is define 阅读全文

摘要： 所有的STL容器 容器（Container）的概念的出现早于模板（template），它原本是一个计算机科学领域中的一个重要概念，但在这里，它的概念和STL混合在一起了。下面是在STL中出现的7种容器： vector（向量）——STL中标准而安全的数组。只能在vector 的“前面”增加数据。 deque（双端队列double-ended queue）——在功能上和vector相似，但是可以在前后两端向其中添加数据。 list（列表）——游标一次只可以移动一步。如果你对链表已经很熟悉，那么STL中的list则是一个双向链表（每个节点有指向前驱和指向后继的两个指针）。 set（集合）—... 阅读全文

摘要： PrimesTimeLimit:3000MSDescriptionInapavilion,visitorswillgetahithertounknowncutting-edgeinteractiveexperience,afieldfullofimaginationandthejoyoftheinformationcommunicationinteractiveexperienceshowwillbeanewform,fromtheaudienceintotheexhibitionhallofthefirststep,willandhandheldterminalsareinseparable 阅读全文

摘要： 住房安排TimeLimit:3000MSDescription第三十届夏季奥林匹克运动会于2012年7月27日至8月12日在英国首都伦敦举行，历时19天。为了更好地接待在这期间来自世界各地的参赛者，如何合理安排各宾馆的住房问题提到了日程。组委会已接到了大量的客户住宿定单，每张定单的内容包括要住宿的房间数，开始住宿时间和要住的天数。为了便于整个城市各宾馆的管理，组委会希望对这些定单进行安排，目的是用尽可能少的房间来满足这些定单，以便空出更多的房间用于安排流动游客。组委会请求Jenny来完成这个任务，对这些定单进行合理安排，使得满足这些定单要求的房间数最少。假设某个定单上的游客一旦被安排到某房间， 阅读全文

摘要： 愚人节的礼物Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2194Accepted Submission(s): 1387Problem Description四月一日快到了，Vayko想了个愚人的好办法——送礼物。嘿嘿，不要想的太好，这礼物可没那么简单，Vayko为了愚人，准备了一堆盒子，其中有一个盒子里面装了礼物。盒子里面可以再放零个或者多个盒子。假设放礼物的盒子里不再放其他盒子。用()表示一个盒子，B表示礼物，Vayko想让你帮她算出愚 阅读全文