Dice Combinations

MOD = 10**9 + 7

def count_ways_to_sum(n):
    # DP array to store the number of ways to form sum i
    dp = [0] * (n + 1)
    
    # Base case: There is 1 way to get a sum of 0 (do nothing)
    dp[0] = 1
    
    # Fill the DP table
    for i in range(1, n + 1):
        for j in range(1, 7): 
            if i - j >= 0:
                dp[i] = (dp[i] + dp[i - j]) % MOD
    
    # The answer is dp[n]
    return dp[n]

# Input
n = int(input())

# Output
print(count_ways_to_sum(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: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: ACCEPTED