Cody

# Problem 108. Given an unsigned integer x, find the largest y by rearranging the bits in x

Solution 1861531

Submitted on 30 Jun 2019 by Jingwei Too
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 76; y_correct = 112; assert(isequal(maxit(x),y_correct))

z = 1 z = 1 0 z = 1 0 0 z = 1 0 0 1 z = 1 0 0 1 1 z = 1 0 0 1 1 0 z = 1 0 0 1 1 0 0

2   Pass
x = 555; y_correct = 992; assert(isequal(maxit(x),y_correct))

z = 1 z = 1 0 z = 1 0 0 z = 1 0 0 0 z = 1 0 0 0 1 z = 1 0 0 0 1 0 z = 1 0 0 0 1 0 1 z = 1 0 0 0 1 0 1 0 z = 1 0 0 0 1 0 1 0 1 z = 1 0 0 0 1 0 1 0 1 1

3   Pass
x = 1000; y_correct = 1008; assert(isequal(maxit(x),y_correct))

z = 1 z = 1 1 z = 1 1 1 z = 1 1 1 1 z = 1 1 1 1 1 z = 1 1 1 1 1 0 z = 1 1 1 1 1 0 1 z = 1 1 1 1 1 0 1 0 z = 1 1 1 1 1 0 1 0 0 z = 1 1 1 1 1 0 1 0 0 0

4   Pass
x = 10000000; y_correct = 16711680; assert(isequal(maxit(x),y_correct))

z = 1 z = 1 0 z = 1 0 0 z = 1 0 0 1 z = 1 0 0 1 1 z = 1 0 0 1 1 0 z = 1 0 0 1 1 0 0 z = 1 0 0 1 1 0 0 0 z = 1 0 0 1 1 0 0 0 1 z = 1 0 0 1 1 0 0 0 1 0 z = 1 0 0 1 1 0 0 0 1 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 0 z = 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 0 0