Cody

# Problem 2487. Create Combination

Solution 2100845

Submitted on 21 Jan 2020 by xr hu
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 = 1; y_correct = 1; assert(isequal(specialNchoosek(x),y_correct))

y = 1

2   Pass
x = []; y_correct = []; assert(isequal(specialNchoosek(x),y_correct))

3   Pass
x = [2 8 2]; y_correct=[1 1 1 1 1 2 1 2 1 1 2 2 1 3 1 1 3 2 1 4 1 1 4 2 1 5 1 1 5 2 1 6 1 1 6 2 1 7 1 1 7 2 1 8 1 1 8 2 2 1 1 2 1 2 2 2 1 2 2 2 2 3 1 2 3 2 2 4 1 2 4 2 2 5 1 2 5 2 2 6 1 2 6 2 2 7 1 2 7 2 2 8 1 2 8 2]; assert(isequal(specialNchoosek(x),y_correct))

y = 1 1 1 1 1 2 1 2 1 1 2 2 1 3 1 1 3 2 1 4 1 1 4 2 1 5 1 1 5 2 1 6 1 1 6 2 1 7 1 1 7 2 1 8 1 1 8 2 2 1 1 2 1 2 2 2 1 2 2 2 2 3 1 2 3 2 2 4 1 2 4 2 2 5 1 2 5 2 2 6 1 2 6 2 2 7 1 2 7 2 2 8 1 2 8 2

4   Pass
x = [3 3 3]; y_correct =[1 1 1 1 1 2 1 1 3 1 2 1 1 2 2 1 2 3 1 3 1 1 3 2 1 3 3 2 1 1 2 1 2 2 1 3 2 2 1 2 2 2 2 2 3 2 3 1 2 3 2 2 3 3 3 1 1 3 1 2 3 1 3 3 2 1 3 2 2 3 2 3 3 3 1 3 3 2 3 3 3]; assert(isequal(specialNchoosek(x),y_correct))

y = 1 1 1 1 1 2 1 1 3 1 2 1 1 2 2 1 2 3 1 3 1 1 3 2 1 3 3 2 1 1 2 1 2 2 1 3 2 2 1 2 2 2 2 2 3 2 3 1 2 3 2 2 3 3 3 1 1 3 1 2 3 1 3 3 2 1 3 2 2 3 2 3 3 3 1 3 3 2 3 3 3

5   Pass
x = [1 1 1 1 1]; y_correct = x; assert(isequal(specialNchoosek(x),y_correct))

y = 1 1 1 1 1

6   Pass
x = [1 1 1 3]; y_correct =[1 1 1 1 1 1 1 2 1 1 1 3]; assert(isequal(specialNchoosek(x),y_correct))

y = 1 1 1 1 1 1 1 2 1 1 1 3