Dice Combinations

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

typedef long long ll;

const ll mod = 1000000000 + 7; 

const ll N = 1000000;

bool computed[N];
ll value[N];

ll dice(ll n) {
    ll count = 0;

    if(n == 0) return 1;
    if(computed[n]) return value[n];

    for(ll i = 1; i<=6; i++) {
        if(n-i >= 0) {
            count += dice(n-i);
            count %= mod;
        }
    }

    value[n] = count % mod;
    computed[n] = true;

    return count;
}

int main() {
    ll n;
    cin >> n;

    ll d = dice(n);
    d %= mod;

    cout << d << 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