Cody

Problem 42918. Addition Partition

Solution 1050032

Submitted on 10 Nov 2016
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
N=5;K=3; assert(isequal(num_sum(N,K),5))

y = 0 0 5 0 1 4 0 2 3 0 3 2 0 4 1 0 5 0 1 1 3 1 2 2 1 3 1 1 4 0 2 2 1 2 3 0

2   Fail
N=7;K=4; assert(isequal(num_sum(N,K),11))

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

Assertion failed.

3   Pass
N=7;K=3; assert(isequal(num_sum(N,K),8))

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

4   Fail
N=15;K=6; assert(isequal(num_sum(N,K),110))

y = 0 0 15 0 1 14 0 2 13 0 3 12 0 4 11 0 5 10 0 6 9 0 7 8 0 8 7 0 9 6 0 10 5 0 11 4 0 12 3 0 13 2 0 14 1 0 15 0 1 1 13 1 2 12 1 3 11 1 4 10 1 5 9 1 6 8 1 7 7 1 8 6 1 9 5 1 10 4 1 11 3 1 12 2 1 13 1 1 14 0 2 2 11 2 3 10 2 4 9 2 5 8 2 6 7 2 7 6 2 8 5 2 9 4 2 10 3 2 11 2 2 12 1 2 13 0 3 3 9 3 4 8 3 5 7 3 6 6 3 7 5 3 8 4 3 9 3 3 10 2 3 11 1 3 12 0 4 4 7 4 5 6 4 6 5 4 7 4 4 8 3 4 9 2 4 10 1 4 11 0 5 5 5 5 6 4 5 7 3 5 8 2 5 9 1 5 10 0 6 6 3 6 7 2 6 8 1 6 9 0 7 7 1 7 8 0

Assertion failed.

5   Fail
N=20;K=4; assert(isequal(num_sum(N,K),108))

y = 0 0 20 0 1 19 0 2 18 0 3 17 0 4 16 0 5 15 0 6 14 0 7 13 0 8 12 0 9 11 0 10 10 0 11 9 0 12 8 0 13 7 0 14 6 0 15 5 0 16 4 0 17 3 0 18 2 0 19 1 0 20 0 1 1 18 1 2 17 1 3 16 1 4 15 1 5 14 1 6 13 1 7 12 1 8 11 1 9 10 1 10 9 1 11 8 1 12 7 1 13 6 1 14 5 1 15 4 1 16 3 1 17 2 1 18 1 1 19 0 2 2 16 2 3 15 2 4 14 2 5 13 2 6 12 2 7 11 2 8 10 2 9 9 2 10 8 2 11 7 2 12 6 2 13 5 2 14 4 2 15 3 2 16 2 2 17 1 2 18 0 3 3 14 3 4 13 3 5 12 3 6 11 3 7 10 3 8 9 3 9 8 3 10 7 3 11 6 3 12 5 3 13 4 3 14 3 3 15 2 3 16 1 3 17 0 4 4 12 4 5 11 4 6 10 4 7 9 4 8 8 4 9 7 4 10 6 4 11 5 4 12 4 4 13 3 4 14 2 4 15 1 4 16 0 5 5 10 5 6 9 5 7 8 5 8 7 5 9 6 5 10 5 5 11 4 5 12 3 5 13 2 5 14 1 5 15 0 6 6 8 6 7 7 6 8 6 6 9 5 6 10 4 6 11 3 6 12 2 6 13 1 6 14 0 7 7 6 7 8 5 7 9 4 7 10 3 7 11 2 7 12 1 7 13 0 8 8 4 8 9 3 8 10 2 8 11 1 8 12 0 9 9 2 9 10 1 9 11 0 10 10 0

Assertion failed.

6   Fail
N=12;K=9; assert(isequal(num_sum(N,K),73))

y = 0 0 12 0 1 11 0 2 10 0 3 9 0 4 8 0 5 7 0 6 6 0 7 5 0 8 4 0 9 3 0 10 2 0 11 1 0 12 0 1 1 10 1 2 9 1 3 8 1 4 7 1 5 6 1 6 5 1 7 4 1 8 3 1 9 2 1 10 1 1 11 0 2 2 8 2 3 7 2 4 6 2 5 5 2 6 4 2 7 3 2 8 2 2 9 1 2 10 0 3 3 6 3 4 5 3 5 4 3 6 3 3 7 2 3 8 1 3 9 0 4 4 4 4 5 3 4 6 2 4 7 1 4 8 0 5 5 2 5 6 1 5 7 0 6 6 0

Assertion failed.

7   Pass
N=13;K=3; assert(isequal(num_sum(N,K),21))

y = 0 0 13 0 1 12 0 2 11 0 3 10 0 4 9 0 5 8 0 6 7 0 7 6 0 8 5 0 9 4 0 10 3 0 11 2 0 12 1 0 13 0 1 1 11 1 2 10 1 3 9 1 4 8 1 5 7 1 6 6 1 7 5 1 8 4 1 9 3 1 10 2 1 11 1 1 12 0 2 2 9 2 3 8 2 4 7 2 5 6 2 6 5 2 7 4 2 8 3 2 9 2 2 10 1 2 11 0 3 3 7 3 4 6 3 5 5 3 6 4 3 7 3 3 8 2 3 9 1 3 10 0 4 4 5 4 5 4 4 6 3 4 7 2 4 8 1 4 9 0 5 5 3 5 6 2 5 7 1 5 8 0 6 6 1 6 7 0

8   Fail
N=12;K=2; assert(isequal(num_sum(N,K),7))

y = 0 0 12 0 1 11 0 2 10 0 3 9 0 4 8 0 5 7 0 6 6 0 7 5 0 8 4 0 9 3 0 10 2 0 11 1 0 12 0 1 1 10 1 2 9 1 3 8 1 4 7 1 5 6 1 6 5 1 7 4 1 8 3 1 9 2 1 10 1 1 11 0 2 2 8 2 3 7 2 4 6 2 5 5 2 6 4 2 7 3 2 8 2 2 9 1 2 10 0 3 3 6 3 4 5 3 5 4 3 6 3 3 7 2 3 8 1 3 9 0 4 4 4 4 5 3 4 6 2 4 7 1 4 8 0 5 5 2 5 6 1 5 7 0 6 6 0

Assertion failed.

9   Fail
N=15;K=2; assert(isequal(num_sum(N,K),8))

y = 0 0 15 0 1 14 0 2 13 0 3 12 0 4 11 0 5 10 0 6 9 0 7 8 0 8 7 0 9 6 0 10 5 0 11 4 0 12 3 0 13 2 0 14 1 0 15 0 1 1 13 1 2 12 1 3 11 1 4 10 1 5 9 1 6 8 1 7 7 1 8 6 1 9 5 1 10 4 1 11 3 1 12 2 1 13 1 1 14 0 2 2 11 2 3 10 2 4 9 2 5 8 2 6 7 2 7 6 2 8 5 2 9 4 2 10 3 2 11 2 2 12 1 2 13 0 3 3 9 3 4 8 3 5 7 3 6 6 3 7 5 3 8 4 3 9 3 3 10 2 3 11 1 3 12 0 4 4 7 4 5 6 4 6 5 4 7 4 4 8 3 4 9 2 4 10 1 4 11 0 5 5 5 5 6 4 5 7 3 5 8 2 5 9 1 5 10 0 6 6 3 6 7 2 6 8 1 6 9 0 7 7 1 7 8 0

Assertion failed.

Suggested Problems

More from this Author80

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!