My C++ solution for Project Euler 249: Prime Subset Sums
// odd prime numbers are marked as "true" in a bitvector std::vector<bool>sieve; // return true, if x is a prime number boolisPrime(unsignedintx) { // handle even numbers if((x&1)==0) returnx==2; // lookup for