This question already has an answer here:

My challenge Solve Subset-Sum in polynomial time (...if P = NP) was closed as a duplicate of Golf the Subset-Sum Problem. But the aspect of my challenge makes it very different. The main difficulty of my challenge is to succinctly enumerate programs (see the pseudocode I wrote in the linked challenge).

I'm not sure exactly what to do about this, but precedent says I should just ask on meta.


marked as duplicate by Shaggy, mbomb007, Erik the Outgolfer, Sriotchilism O'Zaic, Jo King Apr 10 at 3:39

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.


It seems that the close voters saw the similarities between the two challenges, and interpreted your challenge as a duplicate without reading the finer details that distinguish it from the other challenge. Thankfully, one of our users has reopened the challenge.

I would like to remind close voters to read challenges carefully before voting to close, as an unwarranted closure can be very offputting to new users.


Not the answer you're looking for? Browse other questions tagged .