设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是li ，1 ≤ i ≤ n。程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。

编程任务：

对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。-N a procedure with (1,2, ..., n) to be stored in the length L of the tape. Procedures i stored in the tape length is li, 1 ≤ i ≤ n. Storage procedures require a procedure to determine n in a tape storage solution that makes it possible to store on tape the procedure as much as possible. Programming tasks: for a given n the procedures stored in the tape length, calculated on the tape can store up to a few of the procedures.