- 博客(9)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 ZOJ 1025 Wooden Sticks
Wooden SticksTime limit: 1 Seconds Memory limit: 32768K Total Submit: 623 Accepted Submit: 269 There is a pile of n wooden sticks. The length and weight of each stick are known in adva
2009-08-17 15:39:00
717
原创 ZOJ 1095 Humble Numbers
Humble NumbersTime Limit: 1 Second Memory Limit: 32768 KB A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 1
2009-08-14 19:35:00
571
原创 ZOJ 1047 Image Perimeters
Image PerimetersTime Limit: 1 Second Memory Limit: 32768 KB Technicians in a pathology lab analyze digitized images of slides. Objects on a slide are selected for analysis by a mouse clic
2009-08-08 23:21:00
642
原创 ZOJ 1005 Jugs
JugsTime Limit: 1 Second Memory Limit: 32768 KB Special Judge In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given
2009-08-08 18:39:00
974
原创 ZOJ 2412 Farm Irrigation
Farm IrrigationTime Limit: 1 Second Memory Limit: 32768 KB Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipe
2009-08-08 18:29:00
649
原创 ZOJ 1004 Anagrams by Stack
Anagrams by StackTime Limit: 1 Second Memory Limit: 32768 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can conve
2009-07-28 16:23:00
862
原创 关于回溯法
回溯法是一种择优搜索法，有“通用解题法”之称。用它可以系统地搜索问题的所有解。 它按择优条件向前搜索，以达到目标。当搜索到某一步，发现原先条件并不优或是达不到目标，就向前回 溯，重新选择。 回溯法在问题的解空间树中，按深度优先策略，从根结点开始搜索解空间树。搜索至空间树的任一结点时， 先判断该结点是否包含问题的解。如果肯定该结点不包含问题的解，则跳过以该结点为根的子
2009-07-23 19:28:00
800
原创 ZOJ 1002 Fire Net
Fire Net Time Limit: 1 Second Memory Limit: 32768 KB Suppose that w
2009-07-22 11:10:00
904
转载 【转载】ACM常用算法及其相应的练习题
一位ACM大牛给的建议～大牛给的计划——一般要做到50行以内的程序不用调试、100行以内的二分钟内调试成功.ACM主要是考算法的,主要时间是花在思考算法上，不是花在写程序与debug上。下面给个计划你练练：第一阶段：练经典常用算法，下面的每个算法给我打上十到二十遍，同时自己精简代码，因为太常用，所以要练到写时不用想，10-15分钟内打完，甚至关掉显示器都可以把程
2009-07-21 10:59:00
1157
3
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人