Indian Computing Olympiad Archives 2010
How do I solve this problem within time constraints. My naive implementation recursively checks all 2^N.
Indian Computing Olympiad Archives 2010
How do I solve this problem within time constraints. My naive implementation recursively checks all 2^N.