Cody

# Problem 1941. Lowest sum from a group of digits

Solution 508207

Submitted on 4 Oct 2014 by rifat
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))

a = 13 b = 20

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

a = 138 b = 279

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

a = 789 b = 789

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

a = 13579 b = 20468

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

a = 700077 b = 700007

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

a = 100000111 b = 100000111

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

a = 123456789 b = 102345678

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

a = 12345679 b = 10234568