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).
Problem Recent Solvers25
Suggested Problems
-
1830 Solvers
-
176 Solvers
-
Sort numbers by outside digits
140 Solvers
-
Convert a vector into a number
575 Solvers
-
Create a vector whose elements depend on the previous element
534 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!