Dice Combinations

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin >> n;
    vector<ll> ans;
    ans.reserve(n);
    ll mod = 1000000007ll;

    for (int i=0; i<min(n, 6); i++) {
        ans[i] = 1;
    }

    for (int i=1; i<n; i++) {
        ll subtotal = 0;
        for (int j=max(0, i-6); j<i; j++) {
            subtotal += ans[j];
        }
        ans[i] += subtotal;
        ans[i] %= mod;
    }

    cout << ans[n - 1] % mod << endl;
    return 0;
}

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