gskoli posted Help Me in following code ::, but the question wasn't very clear due to english not being his first language. And with the posted code being rather long, it didn't receive much attention. We've now clarified what he needs, and I'm posting this on his behalf to try and get him an answer.

He has the following array of values:

my @a = qw(
    121 182 111 160 105 113 121 97 123 157 133 161 141 135 137 145
    133 137 151 118 126 141 174 181 154 109 198 114 122 162 91 99
    116 122 195 199 150 192 163 88 112 157 182 210 124 105 144 166
    144 257 164 156 173 154 193 142 143 126 118 130 107 86 131 154
    131 147 134 118 115 135 141 158 129 143 126 128 134 129 167 130
    135 117 127 146 96 117 99 99 139 152 149 136 105 124 136 160
    160 139 177 115 123 103 150 183 132 171 121 114 111 113 131
    144 122 141 111 139 145 109 114 122 103 160 153 147 172 155 122
    296 124 112 161 124 311 99 157 122 120 198 152 140 162 177 98
    138 156 177 103 180 187 173 150 135 168 132 196 112 195 126 113
    116 105 116 151 216 188 158 121 166 148 132 89 197 92 115 98
    130 103 120 261 143 126 167 203 95 165 129
);
[download]

And he wishes to pack them into groups of 6, (or 5 or 4 at a pinch), such that each group totals to between 840 and 900 inclusive.

It is a variation on the bin packing problem, that is not catered for by either of the modules I've looked at. Algorithm::BinPack & Algorithm::Bucketize.

Can any of you CS guys offer him a solution? Canned or otherwise.