上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 53 下一页
摘要: Free DIY TourTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2061Accepted Submission(s): 664Problem DescriptionWeiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is s 阅读全文
posted @ 2013-01-28 09:02 剑不飞 阅读(251) 评论(0) 推荐(0) 编辑
摘要: Max Sum Plus Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 838 Accepted Submission(s): 417Problem Description给定一个由n个正整数组成的整数序列a1 a2 a3 ... an求按先后次序在其中取m段长度分别为l1、l2、l3...lm的不交叠的连续整数的和的最大值。Input第一行是一个整数n(0 ≤ n ≤ 1000),n = 0表示输入结束第二行的第一个数是 阅读全文
posted @ 2013-01-27 12:42 剑不飞 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Pascal's Travels Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1115 Accepted Submission(s): 488Problem DescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate 阅读全文
posted @ 2013-01-27 10:34 剑不飞 阅读(191) 评论(0) 推荐(0) 编辑
摘要: 猜数字Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1596 Accepted Submission(s): 910Problem Description猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的:计算机随机产生一个四位数,然后玩家猜这个四位数是什么。每猜一个数,计算机都会告诉玩家猜对几个数字,其中有几个数字在正确的位置上。比如计算机随机产生的数字为1122。如果玩家猜1234,因为1,2这两个数字同时存在于这两个数 阅读全文
posted @ 2013-01-26 19:51 剑不飞 阅读(213) 评论(0) 推荐(0) 编辑
摘要: SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5180 Accepted Submission(s): 2600Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. K 阅读全文
posted @ 2013-01-26 19:14 剑不飞 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 钥匙计数之一Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1001 Accepted Submission(s): 406Problem Description一把锁匙有N个槽,槽深为1,2,3,4。每锁匙至少有3个不同的深度且至少有1对相连的槽其深度之差为3。求这样的锁匙的总数。Input本题无输入Output对N>=2且N #include using namespace std; const int mm=40; long lo 阅读全文
posted @ 2013-01-26 18:30 剑不飞 阅读(247) 评论(0) 推荐(0) 编辑
摘要: Eddy's research IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2182 Accepted Submission(s): 806Problem DescriptionAs is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other h 阅读全文
posted @ 2013-01-25 15:50 剑不飞 阅读(146) 评论(0) 推荐(0) 编辑
摘要: Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14714 Accepted Submission(s): 6106Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = anoth. 阅读全文
posted @ 2013-01-25 13:38 剑不飞 阅读(170) 评论(0) 推荐(0) 编辑
摘要: Employment PlanningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2597 Accepted Submission(s): 1013Problem DescriptionA project manager wants to determine the number of the workers needed in every month. He does know the minimal number of the wor 阅读全文
posted @ 2013-01-25 12:59 剑不飞 阅读(189) 评论(0) 推荐(0) 编辑
摘要: 方格取数(1)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2585 Accepted Submission(s): 976Problem Description给你一个n*n的格子的棋盘,每个格子里面有一个非负数。从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取的数所在的2个格子不能相邻,并且取出的数的和最大。Input包括多个测试实例,每个测试实例包括一个整数n 和n*n个非负数(n #include #includ 阅读全文
posted @ 2013-01-24 15:54 剑不飞 阅读(198) 评论(0) 推荐(0) 编辑
上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 53 下一页