Partitioning & inner product solve this.
Instead of a clever partitioning algorithm, I recognized the problem is sufficiently small for my computer and used
{3#<i.101
followed by copy of the items with sums less than 101, stitched to whatever value would make the rank 1 sum come out to 100.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to