Cody

Problem 590. Greed is good - Simple partition P[n].

Solution 2424787

Submitted on 30 May 2020
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   Fail
x = 10000; y_correct = x; z = simplepartition(x); zL = length(z); assert(isequal(sum(unique(z)),y_correct) && zL >= ceil(log2(x)/2)) x = 40190; y_correct = x; z = simplepartition(x); zL = length(z); assert(isequal(sum(unique(z)),y_correct) && zL >= ceil(log2(x)/2)) x = 149; y_correct = x; z = simplepartition(x); zL = length(z); assert(isequal(sum(unique(z)),y_correct) && zL >= ceil(log2(x)/2))

y = 30 9970 9980 20

Assertion failed.