| User since: |
Aug 02, 2001 at 02:34 UTC
(24 years ago) |
| Last here: |
Jul 16, 2019 at 21:39 UTC
(6 years ago) |
| Experience: |
75
|
| Level: | Acolyte (3) |
| Writeups: |
20
|
| Location: | Vermont |
| User's localtime: |
Jun 12, 2025 at 20:32 -05
|
| Scratchpad: |
None.
|
| For this user: | Search nodes |
|
A poor data Drone, being pulled in many directions at once.
Forced to code in Korn, c, c++ and even (GASP!) Java instead of
his beloved Perl. Favorite project du jour: Given N groups of
objects of three different types that have a numerical quantity of
sub-objects. Each group containing up to 20 objects. Determine
the optimum combination of 'objects' from one group with
objects from another group, such that the numerical quantities
of sub-objects in each group matches as close as possible.
The count of sub-objects varies in some form of distribution.
|
