资源列表
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
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).
01_hello
- 博创arm 3000开发板实验，hello。适合搞嵌入式的同学入门。
02_pthread
- 博创arm 3000开发板实验，pthread。适合搞嵌入式的同学入门。
03_tty
- 博创arm 3000开发板实验，tty。适合搞嵌入式的同学入门。
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).
04_ad
- 博创arm 3000开发板实验，ad转换。适合搞嵌入式的同学入门。
05_da
- 博创arm 3000开发板实验，da转换。适合搞嵌入式的同学入门。
06_can
- 博创arm 3000开发板实验，can。适合搞嵌入式的同学入门。
07_led
- 博创arm 3000开发板实验，led。适合搞嵌入式的同学入门。
08_motor
- 博创arm 3000开发板实验，motor。适合搞嵌入式的同学入门。
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 &