Cody

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

Solution 1441009

Submitted on 14 Feb 2018 by William
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
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))

Suggested Problems

More from this Author10

Community Treasure Hunt

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

Start Hunting!