Dice Combinations

from functools import cache
import sys

mod = int(1E9)+7
@cache
def countThrows(nn, depth = 0):
    assert(nn >= 0)
    if nn == 0:
        return 1
    su = 0
    # print(depth)
    for ii in range(1,7):
        if nn - ii < 0:
            continue
        su += countThrows(nn-ii, depth + 1)
        su %= mod
    return su
def dp(inpt):
    myCahce = [0]*(inpt+1)
    myCahce[0] = 1
    for ii in range(1, inpt+1):
        for jj in range(1,7):
            if (ii - jj < 0): continue
            myCahce[ii] += myCahce[ii-jj]
            myCahce[ii] %= mod
    return(myCahce[-1])

inpt = int(input())
dpCount = dp(inpt)
print(dpCount)

# for ii in range(1,100):
 #    dpCount = dp(ii)
  #   recCount = countThrows(ii)
    # print(dpCount)
    # print(recCount)
   #  print(recCount == dpCount)
    # print()

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