Counting All Subsets — Solution & Editorial

Back to the Problem

The answer is 2^N; compute with binary exponentiation since N is huge.

Complexity: O(log N)