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

Created by Muthu Annamalai

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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:jc w:val=\"left\"/></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>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 174.167px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 87.0833px; transform-origin: 407px 87.0833px; vertical-align: baseline; "><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 169px 8px; transform-origin: 169px 8px; unicode-bidi: normal; "><span style="">Find a simple partition P[n]. E.g. P[10] = 4 + 3 + 2 + 1.</span></span></div><ol style="block-size: 102.167px; counter-reset: list-item 0; font-family: Helvetica, Arial, sans-serif; list-style-type: decimal; margin-block-end: 20px; margin-block-start: 10px; margin-bottom: 20px; margin-top: 10px; perspective-origin: 391px 51.0833px; transform-origin: 391px 51.0833px; margin-top: 10px; margin-bottom: 20px; "><li style="block-size: 20.4333px; counter-reset: none; display: list-item; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-start: 56px; margin-left: 56px; margin-top: 0px; perspective-origin: 363px 10.2167px; text-align: left; transform-origin: 363px 10.2167px; white-space: pre-wrap; margin-left: 56px; "><span style="block-size: auto; display: inline; margin-inline-start: 0px; margin-left: 0px; perspective-origin: 152px 8px; transform-origin: 152px 8px; unicode-bidi: normal; "><span style="">There are many solutions, compute just one set.</span></span></li><li style="block-size: 20.4333px; counter-reset: none; display: list-item; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-start: 56px; margin-left: 56px; margin-top: 0px; perspective-origin: 363px 10.2167px; text-align: left; transform-origin: 363px 10.2167px; white-space: pre-wrap; margin-left: 56px; "><span style="block-size: auto; display: inline; margin-inline-start: 0px; margin-left: 0px; perspective-origin: 70.5px 8px; transform-origin: 70.5px 8px; unicode-bidi: normal; "><span style="">Don't repeat numbers.</span></span></li><li style="block-size: 20.4333px; counter-reset: none; display: list-item; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-start: 56px; margin-left: 56px; margin-top: 0px; perspective-origin: 363px 10.2167px; text-align: left; transform-origin: 363px 10.2167px; white-space: pre-wrap; margin-left: 56px; "><span style="block-size: auto; display: inline; margin-inline-start: 0px; margin-left: 0px; perspective-origin: 43px 8px; transform-origin: 43px 8px; unicode-bidi: normal; "><span style="">Be Greedy ;-)</span></span></li><li style="block-size: 20.4333px; counter-reset: none; display: list-item; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-start: 56px; margin-left: 56px; margin-top: 0px; perspective-origin: 363px 10.2167px; text-align: left; transform-origin: 363px 10.2167px; white-space: pre-wrap; margin-left: 56px; "><span style="block-size: auto; display: inline; margin-inline-start: 0px; margin-left: 0px; perspective-origin: 267px 8px; transform-origin: 267px 8px; unicode-bidi: normal; "><span style="">To check against trivial solutions, E.g. [x-k, k] etc; but I'll provide you with one to start.</span></span></li><li style="block-size: 20.4333px; counter-reset: none; display: list-item; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-start: 56px; margin-left: 56px; margin-top: 0px; perspective-origin: 363px 10.2167px; text-align: left; transform-origin: 363px 10.2167px; white-space: pre-wrap; margin-left: 56px; "><span style="block-size: auto; display: inline; margin-inline-start: 0px; margin-left: 0px; perspective-origin: 133.5px 8px; transform-origin: 133.5px 8px; unicode-bidi: normal; "><span style="">Show me how you write the whole solution.</span></span></li></ol><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 269px 8px; transform-origin: 269px 8px; unicode-bidi: normal; "><span style="">Bonus points if you solve the general problem of producing all unique partitions of [n].</span></span></div></div></div>

Solve

Solution Stats

72 Solutions
22 Solvers

Last Solution submitted on Jan 16, 2022

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 Solvers22

Problem Tags

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 Solvers22

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 Solvers22

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Players