Given an integer, check whether it is Bleak or not.
A number ‘n’ is called Bleak if it cannot be represented as sum of a positive number x and set bit count in x, i.e., x + countSetBits(x) is not equal to n for any non-negative number x.
Input: 4 Output: 1 Explanation: There is no any possible x such that x + countSetbit(x) = 4
Input: 3 Output: 0 Explanation: 3 is not a Bleak number as 2 + countSetBit(2) = 3.
You don't need to read or print anything. Your task is to complete the function is_bleak() which takes n as input parameter and returns 1 if n is not a Bleak number otherwise returns 0.
Expected Time Complexity: O(log(n) * log(n))
Expected Space Complexity: O(1)
1 <= n <= 104
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.