Perfect XOR
Easy Accuracy: 56.18% Submissions: 276 Points: 2

Given a number N, find the total number of possible X such that (N XOR X) == (N OR X), where 0<=X<=N.

Example 1:

Input: N = 5
Output: 2
Explanation:
5 XOR 2 == 5 OR 2 and 
5 XOR 0 == 5 OR 0

Example 2:

Input: N = 7
Output: 1
Explanation: 7 XOR 0 == 7 OR 0

Your Task:
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)

 

Constraints:
1 <= N <= 1018 

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Perfect XOR

Output Window