Problem 590. Greed is good - Simple partition P[n].
Solution Stats
Problem Comments
-
1 Comment
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 Solvers22
Suggested Problems
-
6435 Solvers
-
Numbers with prime factors 2, 3 and 5.
379 Solvers
-
Magic is simple (for beginners)
5218 Solvers
-
Penny flipping - calculate winning probability (easy)
158 Solvers
-
222 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!