资源列表
[Windows编程] problem-1659
说明：未名湖附近共有n个大小湖泊L1, L2, ..., Ln（其中包括未名湖），每个湖泊Li里住着一只青蛙Fi（1 <= i <= n）。如果湖泊Li和Lj之间有水路相连，则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1, x2, ..., xn，请你给出每两个湖泊之间的相连关系。<张磊> 在 2008-10-13 上传 | 大小：6.58kb | 下载：0
[Windows编程] problem-1716
说明：An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b. Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.<张磊> 在 2008-10-13 上传 | 大小：6.89kb | 下载：0
[Windows编程] problem-2573
说明：n people wish to cross a bridge at night. A group of at most two people may cross at any time, and each group must have a flashlight. Only one flashlight is available among the n people, so some sort of shuttle arrangement must be arranged in order t<张磊> 在 2008-10-13 上传 | 大小：6kb | 下载：0
[Windows编程] problem-2620
说明：Given set of line segments [Li , Ri] with integer coordinates of their end points. Your task is to find the minimal subset of the given set which covers segment [0,M] completely (M is a positive integer).<张磊> 在 2008-10-13 上传 | 大小：10.52kb | 下载：0
[Windows编程] problem-2479
说明：Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below: t1 t2 d(A) = max{ ∑ai + ∑aj | 1 <= s1 <= t1 < s2 <= t2 <= n } i=s1 j=s2 Your task is to calculate d(A).<张磊> 在 2008-10-13 上传 | 大小：4.54kb | 下载：0
[Windows编程] problem-2392
说明：The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tower. Each block of type i has height h_i (1 &<张磊> 在 2008-10-13 上传 | 大小：6.47kb | 下载：0
[Windows编程] macrovirusbyorange
说明：一个宏病毒源码 安全365社区 - AnQuan365_com 居安思危、思而有备、备而无患!<周大福> 在 2008-10-13 上传 | 大小：6.11kb | 下载：0