Dice Combinations

#include <iostream>
#include <vector>
#include <math.h>

using namespace std;

const long long MOD = pow(10, 9) + 7;

void algorithm(long long n, vector<long long> &dp) {
    if (n == 0 or n == 1) {
        dp[n] = 1;
    }
    else {
        long long sum = 0;
        long long six = 6;
        for (long long i = 1; i <= min(six, n); ++i)
        {
            if (dp[n - i] == -1)
                algorithm(n-i, dp);
            sum += dp[n - i];
            sum = sum % MOD;
        }
        dp[n] = sum;
    }
}

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

    vector<long long> dp(n + 1, -1);
    algorithm(n, dp);
    cout << dp[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