Suppose we want to fill one array A (which has M elements) such that the sum of the numbers is X. X=A_1_+A_2_+....A_m_ The number of ways to fill this row can be obtained using a combinatorics formulae: (X+M-1) C (X-1).
Can anyone explain ? Thanks in advance.