Cody

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

Find a simple partition P[n]. E.g. P[10] = 4 + 3 + 2 + 1.

  1. There are many solutions, compute just one set.
  2. Don't repeat numbers.
  3. Be Greedy ;-)
  4. To check against trivial solutions, E.g. [x-k, k] etc; but I'll provide you with one to start.
  5. Show me how you write the whole solution.

Bonus points if you solve the general problem of producing all unique partitions of [n].

Solution Stats

58.18% Correct | 41.82% Incorrect
Last Solution submitted on Jun 10, 2018

Problem Recent Solvers22

Suggested Problems

More from this Author10