We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
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.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #249: Prime Subset Sums
You are viewing a single comment's thread. Return to all comments →
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.