随笔分类 -  ACM

上一页 1 2
ACM DP Wooden Sticks
摘要：B -Wooden SticksTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusDescriptionThere 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 time, 阅读全文
posted @ 2013-07-31 11:39 围剿大叔 阅读(252) 评论(0) 推荐(0)
UVA - 100 - The 3n + 1 problem
摘要：The 3n + 1 problemTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionThe 3n+ 1 problemBackgroundProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you 阅读全文
posted @ 2013-07-31 10:39 围剿大叔 阅读(149) 评论(0) 推荐(0)
ACM DP Monkey and Banana
摘要：A -Monkey and BananaTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusDescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. 阅读全文
posted @ 2013-07-30 15:38 围剿大叔 阅读(245) 评论(0) 推荐(0)
2013暑假集训B组训练赛第二场 - C - Purification
摘要：C -PurificationTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 329ADescriptionYou are an adventurer currently journeying inside an evil temple. After defeating a couple of weak zombies, you arrived at a square room consisting of tiles forming ann 阅读全文
posted @ 2013-07-27 17:01 围剿大叔 阅读(210) 评论(0) 推荐(0)
2013暑假集训B组训练赛第二场 - B - Funky Numbers
摘要：B -Funky NumbersTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 192ADescriptionAs you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as, wherekis some positive integer), 阅读全文
posted @ 2013-07-27 14:42 围剿大叔 阅读(265) 评论(0) 推荐(0)
2013暑假集训B组训练赛第二场 - E Queue at the School
摘要：E -Queue at the SchoolTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 266BDescriptionDuring the break the schoolchildren, boys and girls, formed a queue ofnpeople in the canteen. Initially the children stood in the order they entered the canteen. 阅读全文
posted @ 2013-07-27 13:08 围剿大叔 阅读(269) 评论(0) 推荐(0)
2013暑假集训B组训练赛第二场 - A Bus Game
摘要：A -Bus GameTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uDescriptionAfter Fox Ciel won an onsite round of a programming contest, she took a bus to return to her castle. The fee of the bus was 220 yen. She met Rabbit Hanako in the bus. They decided to play the following game 阅读全文
posted @ 2013-07-27 13:03 围剿大叔 阅读(281) 评论(0) 推荐(0)
Burning Midnight Oil
摘要：E -Burning Midnight OilTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionOne day a highly important task was commissioned to Vasya — writing a program in a night. The program consists ofnlines of code. Vasya is already exhausted, so he works like that: fir 阅读全文
posted @ 2013-07-25 11:30 围剿大叔 阅读(199) 评论(0) 推荐(0)
Trouble
摘要：I -TroubleTime Limit:5000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionHassan is in trouble. His mathematics teacher has given him a very difficult problem called 5-sum. Please help him.The 5-sum problem is defined as follows: Given 5 sets S_1,...,S_5 of n integer num 阅读全文
posted @ 2013-07-25 10:08 围剿大叔 阅读(196) 评论(0) 推荐(0)
Oil Deposits
摘要：DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing e 阅读全文
posted @ 2013-07-24 11:31 围剿大叔 阅读(199) 评论(0) 推荐(0)
Values whose Sum is 0
摘要：专题二(分治)131:19:34725:00:00OverviewProblemStatusRankABCDEFGHID -4 Values whose Sum is 0Time Limit:15000MSMemory Limit:228000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet 阅读全文
posted @ 2013-07-18 10:24 围剿大叔 阅读(205) 评论(0) 推荐(0)
ACM-Expanding Rods
摘要：A -Expanding RodsTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionWhen a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls and t 阅读全文
posted @ 2013-07-17 10:37 围剿大叔 阅读(223) 评论(0) 推荐(0)

上一页 1 2