/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.

>>33
WRITE A PROGRAM DAT DRAWS A RANDOM DACHSHUND. DA DACHSHUNDS CUD VARY IN SIZE, COAT COLOUR, FUR LENGTH, ETC. IDEALLY, EACH TIME U RUN DA PROGRAM, U'LL GET A UNIQUE DACHSHUND DRAWING.

U CAN IMPLEMENT DIS HOWEVER U WANT: WRITE UR OWN DOMAIN SPECIFIC LANGUAGE, OUTPUT PNG FILES, OUTPUT WAVEFRONT OBJ FILES, RENDER WITH OPENGL/SDL, WATEVER! ADD WATEVER FEATURES U WANT. U CUD OUTPUT 64x64 DESKTOP ICONS 4 ALL I FUKIN CARE, SO LONG AS DEY LOOK LIKE DACHSHUNDS AND DA OUTPUT HAS SOME VARIATION EACH TIME U RUN IT. DA SKY'S DA FUCKIN LIMIT! HELL, U DONT EVEN NEED TO DO DACHSHUNDS. U CAN DO WHATEVER SO LONG AS U STICK WITH DA BASIC CONCEPT.

NOW, ARE U A BUNCH OF UNIMAGINATIVE CODE MONKEYS OR DO U FUKIN MATH BOIZ HAVE A SPARK OF CREATIVITY IN UR SOULS, HUH?