设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是 Li，程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。-N a procedure with (1,2, ..., n) should be kept in the length L of the tape. Procedures i stored in the tape length is Li, stored procedures to seek to establish that n-tape procedures in a stored program that makes it possible to store on tape as much as possible the procedure. For a given n programs stored in the tape length, programming calculation tape can store up to a few of the procedures.