|
|
|
|
摘要：
点击打开链接BrainmanTime Limit:1000MSMemory Limit:30000KTotal Submissions:7810Accepted:4261DescriptionBackgroundRaymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Char 阅读全文
posted @ 2013-08-29 13:33 勇敢的炮灰 阅读(346) 评论(0) 推荐(0)
摘要：
点击打开链接Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:34676Accepted:12465DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sor 阅读全文
posted @ 2013-08-29 13:12 勇敢的炮灰 阅读(138) 评论(0) 推荐(0)
摘要：
点击打开链接Who's in the MiddleTime Limit:1000MSMemory Limit:65536KTotal Submissions:28324Accepted:16396DescriptionFJ 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 阅读全文
posted @ 2013-08-29 12:48 勇敢的炮灰 阅读(108) 评论(0) 推荐(0)
摘要：
点击打开链接DNA SortingTime Limit:1000MSMemory Limit:10000KTotal Submissions:75164Accepted:30115DescriptionOne measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this 阅读全文
posted @ 2013-08-29 12:43 勇敢的炮灰 阅读(147) 评论(0) 推荐(0)
摘要：
点击打开链接All in AllTime Limit:1000MSMemory Limit:30000KTotal Submissions:25779Accepted:10421DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss 阅读全文
posted @ 2013-08-29 12:28 勇敢的炮灰 阅读(147) 评论(0) 推荐(0)
摘要：
点击打开链接Blue JeansTime Limit:1000MSMemory Limit:65536KTotal Submissions:10243Accepted:4347DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.As 阅读全文
posted @ 2013-08-28 19:26 勇敢的炮灰 阅读(101) 评论(0) 推荐(0)
摘要：
点击打开链接Spell checkerTime Limit:2000MSMemory Limit:65536KTotal Submissions:16970Accepted:6223DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all the 阅读全文
posted @ 2013-08-28 18:39 勇敢的炮灰 阅读(145) 评论(0) 推荐(0)
摘要：
点击打开链接Numbers That CountTime Limit:1000MSMemory Limit:10000KTotal Submissions:17922Accepted:5940Description"Kronecker's Knumbers" is a little company that manufactures plastic digits for use in signs (theater marquees, gas station price displays, and so on). The owner and sole employee 阅读全文
posted @ 2013-08-28 18:23 勇敢的炮灰 阅读(211) 评论(0) 推荐(0)
摘要：
点击打开链接487-3279Time Limit:2000MSMemory Limit:65536KTotal Submissions:220260Accepted:38393DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by 阅读全文
posted @ 2013-08-26 19:57 勇敢的炮灰 阅读(116) 评论(0) 推荐(0)
摘要：
点击打开链接Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:18904Accepted:6448DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There 阅读全文
posted @ 2013-08-26 17:35 勇敢的炮灰 阅读(109) 评论(0) 推荐(0) |
|
浙公网安备 33010602011771号