Bin Packing My Tags (Edit) Source : SWERC 2005 Time limit : 1 sec Memory limit : 32 M Submitted : 412, Accepted : 173 A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the samelength l and each item i has length l i <= l. We look for a minimal number of bins q such that each bin contains at most 2 items,