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 restricted-complexity 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.