Problem 590. Greed is good - Simple partition P[n].
Solution Stats
Problem Comments
-
1 Comment
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).
Solution Comments
Show commentsProblem Recent Solvers25
Suggested Problems
-
Maximum running product for a string of numbers
1897 Solvers
-
Return unique values without sorting
857 Solvers
-
235 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
772 Solvers
-
Who has power to do everything in this world?
415 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!