Adam Shelly wrote:
> On 2/5/06, Luke Blanshard <luke / blanshard.us> wrote:
>   
>> My submission is attached.  The key insight: if you start with the
>> largest values you can divide the loot one gang member at a time without
>> fear of getting wrongly stuck.
>>     
> ...
>   
>> Technically, this is not so much an insight as an intuition.  It might
>> not be true in all cases.  But using it as a heuristic, we can cut the
>> solution down to O(n^3).
>>
>>     
>
> I thought I had a similar speedy solution, but then I found a few
> places it fails:...
>   

Rats, you're right.  I came upon an example too.  Oh well.

Luke