08 2012 档案
摘要:QuadrilateralProblem Description One day the little Jack is playing a game with four crabsticks. The game is simple, he want to make all the four crabsticks to be a quadrilateral, which has the biggest area in all the possible ways. But Jack’s math is so bad, he doesn’t know how to do it, can you h.
阅读全文
摘要:Problem DescriptionKiki is considered as a smart girl in HDU, many boys fall in love with her! Now, kiki will finish her education, and leave school, what a pity! One day, zjt meets a girl, who is like kiki very much, in the campus, and calls her little kiki. Now, little kiki want to design a contai
阅读全文
摘要:A. yuna学数论Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 24Accepted Submission(s) : 13Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description在学习完各类算法之后,yuna决定开始学习数论了。yuna神当然从最简单的最小公倍数学起喽~~~~~定义 为1,2,…,n的最小公倍数,例如,B1= 1,B2= 2,B3= 6,B4= 12
阅读全文
摘要:G. SwimmingProblem DescriptionIn the 2012 London Olympics, Sun Yang, the young Chinese swimmer, wins 2 golden medals and breaks the world record of men's 1500m freestyle. As a Chinese, we are proud of him, and as a ACMer, we can do some simple research on the results show system of the swimming.
阅读全文
摘要:B. Merlininice’s HometaskFont: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionMerlininice dosen’t love math lessons, so he always ditches math class. But as the final exam is coming, now Merlininice is really regret his actions and wants to get a good mark for math. For that Ms.
阅读全文
摘要:CardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10Accepted Submission(s): 9Problem DescriptionBearchild is playing a card game with himself. But first of all, he needs to shuffle the cards. His strategy is very simple: After putting all the car
阅读全文
摘要:Gold minerTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem DescriptionHomelesser likes playing Gold miners in class. He has to pay much attention to the teacher to avoid being noticed. So he always lose the game. Af
阅读全文
摘要:K. ServiceTime Limit:1000MSDescriptionThere is a large and beautiful polygon pond in HY city. Lina wants to offer a service which can tell people how to travel around the pond easier. She entrusts you to finish this job. People can walk on the edge of the polygon pond.She will tell you the coordinat
阅读全文
摘要:H. DistributionTime Limit:1500MSDescriptionOne day, Obama dreamed that he and Clinton went together to steal jewellery, got n pieces of the jewellerys. How to divide stolen jewellerys became a problem,because the estimated value of each pieces of the jewellery are not the same to them.If the total v
阅读全文
摘要:F. TravelingTime Limit:3000MSDescriptionAlice is a Beautiful horse,earning the title 'Miss Horse World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) grassland around the world in order to spread goodwill to the other horses. For simplicity, the world will be represente
阅读全文
摘要:E. 住房安排Time Limit:3000MSDescription第三十届夏季奥林匹克运动会于2012年7月27日至8月12日在英国首都伦敦举行,历时19天。为了更好地接待在这期间来自世界各地的参赛者,如何合理安排各宾馆的住房问题提到了日程。组委会已接到了大量的客户住宿定单,每张定单的内容包括要住宿的房间数,开始住宿时间和要住的天数。为了便于整个城市各宾馆的管理,组委会希望对这些定单进行安排,目的是用尽可能少的房间来满足这些定单,以便空出更多的房间用于安排流动游客。组委会请求Jenny来完成这个任务,对这些定单进行合理安排,使得满足这些定单要求的房间数最少。假设某个定单上的游客一旦被安排到
阅读全文
摘要:JapanTime Limit:1000MSMemory Limit:65536KTotal Submissions:14697Accepted:3945DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <= 1000, N <= 1000). K
阅读全文
摘要:StarsTime Limit:1000MSMemory Limit:65536KTotal Submissions:22249Accepted:9689DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the r
阅读全文
摘要:QueryTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 531Accepted Submission(s): 164Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:1) 1 a i c - you should set i-th ch
阅读全文
摘要:TroubleTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1159Accepted Submission(s): 375Problem 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
阅读全文
摘要:King Arthur's KnightsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 248Accepted Submission(s): 109Special 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
阅读全文
摘要:Mobile phonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:10930Accepted:5002DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered
阅读全文
摘要:Counting the algorithmsMy Tags(Edit)Source:mostlegTime limit: 1 secMemory limit: 64 MSubmitted: 484,Accepted: 186As most of the ACMers, wy's next target is algorithms, too. wy is clever, so he can learn most of the algorithms quickly. After a short time, he has learned a lot. One day,mostlegaske
阅读全文
摘要:经理的烦恼My Tags(Edit)Source:HCPC 2005 SpringTime limit: 2 secMemory limit: 32 MSubmitted: 1927,Accepted: 441Jerry是一家公司销售部门的经理。这家公司有很多连锁店,编号为1,2,3,... Jerry每天必须关注每家连锁店的商品数量及其变化,一项很乏味的工作。在连锁店比较少的时候,Jerry喜欢计算编号在[i,j]区间内的连锁店中商品数量为素数的有多少家,但是现在连锁店的数量急剧增长,计算量很大,Jerry很难得出结果。输入格式题目有多组输入。每组输入第一行有三个整数:C 连锁店的数量 N
阅读全文
摘要:Arcane Numbers 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 871Accepted Submission(s): 277Problem DescriptionVance and Shackler like playing games. One day, they are playing a game called "arcane numbers". The game is pretty simple, V
阅读全文

浙公网安备 33010602011771号