Dice Combinations

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

array<int, 1000000> c;
int dp(int x) {
    if(c[x] != 0) return c[x];
    ll s = 0;

    int end = max(0, x - 6);
    for (int i = x - 1; i >= end; i--) {
        s += dp(i);
    }

    s = s % 1000'000'007;
    c[x] = s;
    return s; 
}

void solve() {
    int n;
    cin >> n;

    c[0] = 1;

    cout << dp(n);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    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