DynamicProgramming dice sum number of ways
<p>Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X. X is the summation of values on each face when all the dice are thrown.
4+3 and 3+4 should be treated same.
dont consider different permutations.
Example for n=2 , m =6 and X = 7
No of ways should be 3 ( 1,6  and 2,5 and 3,4)</p>