Problem 590. Greed is good - Simple partition P[n].
41.03% Correct | 58.97% Incorrect
Last Solution submitted on Nov 01, 2022
Rafael S.T. Vieira on 3 Oct 2020
Maybe you should say that the partition must have size greater than ceil(log2(x)/2)), since you test this at the test suite. The total number of partitions that a number has may be huge, even if we consider only unique sets (ignoring the order): a sum of binomial coefficients from 1 to the number-1 (where there is only one possible set of ones).
Problem Recent Solvers25
Convert a numerical matrix into a cell array of strings
Return elements unique to either input
Make a run-length companion vector
More from this Author10
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!