OJ Board

How did you attached primes to this problem?
May be you have mixed up some problems?

You are right. I mixed up this problem with another one I saw. And misreading this one, I assumed one has to form a list of prime numbers in ascending order of B(n). That was confusing me a lot. :)

Now that the ...

Thanks.

Obviously I have arrays with nonconstant lengths, and you can make them constant or dynamically allocate them, your call.

:) Thanks for your reply.

How about using std::map<int,bool> taken; instead of bool taken[ totalitemcount ]; ? (not sure if thats an overkill ... or may even hurt performance ...

I usually generate combinations using this method:

If I have to generate combinations of k out of n elements, I loop from 0 to 2^n-1 and count the number of 1s in each iteration's bin. representation. If the number of 1s=k, I pick it and the positions with 1s are considered IN and others OUT. This ...

I've been thinking about 10232 (Bitwise Sequence), and the only way I could think of doing it was to

Taking 2 to be the only prime number with one 1 in its bin. representation,

1. generate all combinations of two 1s (with 1 in the last placeholder, as even numbers are not to be checked), and ...

umm... I'm feeling quite clueless attempting this problem.