Dice Combinations

MOD = 10**9 + 7

def count_ways(n):
    if n == 0:
        return 1
    if n < 0:
        return 0
    
    # Initialize dp array and window_sum
    dp = [0] * (n + 1)
    dp[0] = 1
    window_sum = dp[0]

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

    return dp[n]

# Input
n = int(input())

# Output the number of ways to construct the sum n
print(count_ways(n))

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