title: Partition function in c++
body: <p>I need an algorithmic solution in c++ for the <a href="http://en.wikipedia.org/wiki/Partition_%28number_theory%29" rel="nofollow">partition-problem</a></p>
  
  <p>Simple explanation: Find all sums that get a number n.
  For example</p>
  
  <ul>
  <li>Input: 5</li>
  <li>Output:
  <ul>
  <li>11111</li>
  <li>2111</li>
  <li>311</li>
  <li>41</li>
  <li>5</li>
  <li>221</li>
  <li>23</li>
  </ul></li>
  </ul>
  
  <p>This problem seems so easy, but I couldn't find a solution. I'm close to make this bruteforce, because the highest input is 11. The articles about that problem are highly mathematic and I don't really get it.</p>
  
  <p>Thank you all!</p>