Problem 2735. Binary Neighbourhood
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
Alfonso Nieto-Castanon
on 19 Jan 2015
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...
Jan Orwat
on 19 Jan 2015
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.
Alfonso Nieto-Castanon
on 23 Jan 2015
but I liked your fix for the ans trick, I wish that was part of the standard cody scoring!
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers91
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!