Cody

# Problem 1941. Lowest sum from a group of digits

Solution 578228

Submitted on 9 Feb 2015 by goc3
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))

s = 1 2 0 3 a = 10 b = 23 ans = 33

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

s = 1 2 3 7 8 9 a = 138 b = 279 ans = 417

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

s = 7 7 8 8 9 9 a = 789 b = 789 ans = 1578

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

s = 1 2 0 3 4 5 6 7 8 9 a = 10468 b = 23579 ans = 34047

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

s = 7 7 0 0 0 0 0 0 0 7 7 7 a = 700007 b = 700077 ans = 1400084

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

s = Columns 1 through 16 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 Columns 17 through 18 1 1 a = 100000111 b = 100000111 ans = 200000222

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

s = Columns 1 through 16 1 1 0 2 2 3 3 4 4 5 5 6 6 7 7 8 Columns 17 through 18 8 9 a = 102345678 b = 123456789 ans = 225802467

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

s = 1 1 0 2 2 3 3 4 4 5 5 6 6 7 8 9 a = 10234568 b = 12345679 ans = 22580247