From: Antonio Cangiano <acangiano@...>
Date: 2006-02-06T00:28:22+09:00
Subject: Re: [QUIZ] Splitting the Loot (#65)

Patrick Hurley wrote:
> I just certainly hope there is not too many treasures, I am pretty
> sure this is NP complete.

It's the famous Subset Sum Problem (a special case of the knapsack 
problem), and generally it's an NP-Complete problem.

Cheers,
Antonio
-- 
Zen and the Art of Ruby Programming
http://antoniocangiano.com