Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

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.

**Example 1:**

**Input: **4
**Output: **1
**Explanation: **There is no any possible x
such that x + countSetbit(x) = 4

**Example 2:**

**Input:** 3
**Output: **0
**Explanation:** 3 is not a Bleak number as
2 + countSetBit(2) = 3.

**Your Task:**

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)

**Constraints:**

1 <= n <= 10^{4}

Login to report an issue on this page.

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

YesLoading...

Bleak Numbers

...