/prog/ challenge

A set of integers is sum-free when addition always gets you out of the set (i.e. x + y = z has no solutions -- in other words S + S and S are disjoint). Formally, let S be a subset of N. S is sum-free if for all a,b in S, a+b is not in S.

Now, let S be any set of nonzero integers. Find a subset of size > |S|/3.

You may use your favorite lisp language.

I've got a really nice solution for this one.

>>18
You are right! Your wording is a bit hairy -- but in any case your code is fine. :)

Okay so we have the bruteforce method, and in perl6 too. I will post my own method in a while (today or tomorrow), as I intend to write it in haskell and I need to brush up my skills a bit.