Dice Combinations

def dice_combinations(n):
    MOD = 10**9 + 7
    dp = [0] * (n + 1)
    dp[0] = 1  # Base case: there's one way to make sum 0 (by not throwing the dice)

    for i in range(1, n + 1):
        for j in range(1, 7):
            if i >= j:
                dp[i] = (dp[i] + dp[i - j]) % MOD

    return dp[n]


n = int(input())

result = dice_combinations(n)
print(result)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED