Given a natural number reorder its binary form to create another number, closest to the given one.
Examples:
- 1 gives 2, ( 1(dec) > 1 > 01 > 10 > 2(dec) )
- 2 gives 1, ( 2(dec) > 10 > 01 > 1(dec) )
- 5 gives 6, ( 5(dec) > 101 > 110 > 6(dec) )
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers99
Suggested Problems
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
254 Solvers
-
The Answer to Life, the Universe, and Everything
577 Solvers
-
With apologies to William Blake
78 Solvers
-
443 Solvers
-
3417 Solvers
More from this Author40
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
one perhpas "unfair" issue with this scoring system is that it penalizes strings by their length (e.g. unique(...,'sorted') costs more points than unique(...,'rows')) which encourages attempting to avoid strings all together...
That's good point. Thanks for your involvement Alfonso. I will disable this feature. I thought it's right approach to count strings like that but your argument shows there are many exceptions, so... not a good idea.
but I liked your fix for the ans trick, I wish that was part of the standard cody scoring!