Problem 590. Greed is good - Simple partition P[n].

Created by Muthu Annamalai

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Find a simple partition P[n]. E.g. P[10] = 4 + 3 + 2 + 1.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"2\"/></w:numPr></w:pPr><w:r><w:t>There are many solutions, compute just one set.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"2\"/></w:numPr></w:pPr><w:r><w:t>Don't repeat numbers.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"2\"/></w:numPr></w:pPr><w:r><w:t>Be Greedy ;-)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"2\"/></w:numPr></w:pPr><w:r><w:t>To check against trivial solutions, E.g. [x-k, k] etc; but I'll provide you with one to start.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"2\"/></w:numPr></w:pPr><w:r><w:t>Show me how you write the whole solution.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Bonus points if you solve the general problem of producing all unique partitions of [n].</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

71 Solutions
25 Solvers

Last Solution submitted on Jun 06, 2021

Last 200 Solutions

Problem Comments

1 Comment

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

Problem Tags

greedy algorithms partition - number theory

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 590. Greed is good - Simple partition P[n].

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers25

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Problem 590. Greed is good - Simple partition P[n].

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers25

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Players