Problems > Counting Dice Rolls

Counting Dice Rolls

Difficulty: 1400 5000 ms 128 MB

dp combinatorics

Count the ways to roll D dice, each showing a face 1..F, so the faces sum to exactly T, modulo 109+7.

Input: one line with three integers D, F, T.

Output: the number of ways mod 109+7.

Constraints:

  • 1 ≤ D, F ≤ 500
  • 1 ≤ T ≤ D·F

Sample Tests

Input 1
2 6 7
Output 1
6
Input 2
1 4 3
Output 2
1

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.