Dice throw
Medium Accuracy: 56.98% Submissions: 4284 Points: 4

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.


Example 1:

M = 6, N = 3, X = 12
There are 25 total ways to get
the Sum 12 using 3 dices with
faces from 1 to 6.

Example 2:

M = 2, N = 3, X = 6
There is only 1 way to get
the Sum 6 using 3 dices with
faces from 1 to 2. All the
dices will have to land on 2.


Your Task:
You don't need to read input or print anything. Your task is to complete the function noOfWays() which takes 3 Integers M,N and X as input and returns the answer.


Expected Time Complexity: O(M*N*X)
Expected Auxiliary Space: O(N*X)


1 <= M,N,X <= 50

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Dice throw

Output Window