News for hackers. Stuff that matters.
Re:A CP Solution for XKCD NP Complete Restaurant Order by bjourne on Tuesday May 28, 2013 @11:25AM (#5780560)
Here is a brute force solution in factor:

    6 [ 10 iota >list ] replicate >list lcartesian-product* [ { 215 275 335 355 420 580 } [ * ] 2map sum 1505 = ] lfilter list>array .
Kind of cheating, but the solution space is so small that brute forcing it becomes viable.

There are no comments on this comment yet.