Dice Summation

#include <bits/stdc++.h>
#define ll long long int
using namespace std;

ll func(ll n){
    ll mod = 1e9 + 7;
    vector<ll> dp(n+1);
    dp[0]=1;
    for(int i = 0; i <= n; ++i)
        for(int j = 1; j <=6 and j<=i; j++)
             dp[i] = (dp[i] + (dp[i - j])) % mod;
    return dp[n];
}
int main()
{
    ll n;
    cin >> n;

    cout << func(n) << endl;
}

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