It is NP-complete, so there's no way a super-efficient general
solution is going to emerge here. However, the evaluation of
any particular ordering doesn't require evaluating all possible
groupings of that ordering. You can merely start adding
stuff until an overflow occurs, switching to the next bag
as necessary. The "best" solution out of the possibilities
evaluated is the one that uses the least containers.
Perl is buff enough to spin through several million
possibilities in realistic time, unless you're using a
version of Perl for Palm Pilot. I would submit that as long
as a Perl Golf program runs in finite time (even extremely,
exponentially long), the point is to make a minimally sized
program that produces the correct solution.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|