given an integer a, find the smallest possible integer b(b>0) such that their bitwise logical AND is zero.
- if a=11(1011) then b=4(0100)
Solution Stats
Problem Comments
Problem Recent Solvers14
Suggested Problems
-
338 Solvers
-
Number of 1s in a binary string
1913 Solvers
-
Matrix with different incremental runs
261 Solvers
-
409 Solvers
-
210 Solvers
More from this Author145
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)