Please enter your email address or userHandle.
Given a number N, find the total number of possible X such that (N XOR X) == (N OR X), where 0<=X<=N.
Input: N = 5
5 XOR 2 == 5 OR 2 and
5 XOR 0 == 5 OR 0
Input: N = 7
Explanation: 7 XOR 0 == 7 OR 0
You don't need to read or print anything. Your task is to complete the function total_count() which takes N as input parameter and returns total count of X.
Expected Time Complexity: O(log(N))
Expected Space Complexity: O(1)
1 <= N <= 1018
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.