I just wanna know any solution which doesn't need pre-calculated constants. I pre-calculated an array with length=7000, and compressed the continuous repeat values so that my submitted code won't exceed 50kB.

https://github.com/Sundesh7/Hackerrank-Solutions/blob/main/Project%20Euler%20%23249:%20Prime%20Subset%20Sumshttps://github.com/Sundesh7/Hackerrank-Solutions/blob/main/Project%20Euler%20%23249:%20Prime%20Subset%20Sums Two cases success!

There is no point of this problem.

In input 0

2 10 4

what is the role of 2 ?

which are less than 4? [2 3 5 5 7 7 17] -> [{2},{3},{5},{2;3},{7},{2;5},{2;3;5;7}]

2 and 3 right? Why does the exercise say 3?