Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

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:**

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

**Example 2:**

Input:M =2,N =3,X =6Output:1Explanation: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)

**Constraints:**

1 <= M,N,X <= 50

Login 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?

Yes
Dice throw

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.