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).
Solution CommentsShow comments
Problem Recent Solvers25
Find the sum of all the numbers of the input vector
Given an unsigned integer x, find the largest y by rearranging the bits in x
Generate N equally spaced intervals between -L and L
More from this Author10
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!