title: Different ways to sum a number using numbers less than or equal to k
body: <p>Example: Given total = 8 and k = 2, the number of different ways of represent 8 as the sum of integers between 1 and 2, inclusive, is 5 ways:</p>
  
  <pre><code>[1, 1, 1, 1, 1, 1, 1, 1]
  [1, 1, 1, 1, 1, 1, 2]
  [1, 1, 1, 1, 2, 2]
  [1, 1, 2, 2, 2]
  [2, 2, 2, 2]
  </code></pre>
  
  <p>Constrains:</p>
  
  <pre><code>1 &lt;= total &lt;= 1000
  i &lt;= k &lt;= 100
  </code></pre>
  
  <p>How can we solve this problem? Dynamic programming?</p>