Cody

# Problem 1941. Lowest sum from a group of digits

Solution 848870

Submitted on 10 Mar 2016 by Alexander
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 = 0:3; y_correct = 33; assert(isequal(lowest_number(x),y_correct))

y = 0 1 2 3 num = 2 y = 33

2   Pass
x=[1 2 3 7 8 9] ; y_correct = 417; assert(isequal(lowest_number(x),y_correct))

y = 1 2 3 7 8 9 y = 417

3   Pass
x=[7 8 9 7 8 9] ; y_correct = 1578; assert(isequal(lowest_number(x),y_correct))

y = 7 7 8 8 9 9 y = 1578

4   Pass
x = 0:9; y_correct = 34047; assert(isequal(lowest_number(x),y_correct))

y = 0 1 2 3 4 5 6 7 8 9 num = 2 y = 34047

5   Pass
x=7*[ones(1,5) zeros(1,7)]; y_correct=1400084; assert(isequal(lowest_number(x),y_correct))

y = 0 0 0 0 0 0 0 7 7 7 7 7 num = 8 num = 7 num = 6 num = 5 num = 4 num = 3 num = 2 y = 1400084

6   Pass
x=[ones(1,8) zeros(1,10)]; y_correct=200000222; assert(isequal(lowest_number(x),y_correct))

y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 Columns 17 through 18 1 1 num = 11 num = 10 num = 9 num = 8 num = 7 num = 6 num = 5 num = 4 num = 3 num = 2 y = 200000222

7   Pass
x = [0:9 1:8]; y_correct = 225802467; assert(isequal(lowest_number(x),y_correct))

y = Columns 1 through 16 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 Columns 17 through 18 8 9 num = 2 y = 225802467

8   Pass
x=[randperm(10)-1 randperm(6)]; y_correct=22580247; assert(isequal(lowest_number(x),y_correct))

y = 0 1 1 2 2 3 3 4 4 5 5 6 6 7 8 9 num = 2 y = 22580247