Dice Combinations

#include <vector>
#include <iostream>

using namespace std;

const int mod = 1000000007;

int recur(int i, vector<bool> &r, vector<int> &v) {
    if (i <= 6) {
        return 1 << (i - 1);
    }
    if (r[i]) {
        return v[i];
    }
    r[i] = true;
    long s = 0;
    for (int j = 1; j <= 6; ++j) s += recur(i - j, r, v);
    v[i] = s % mod;
    return v[i];
}

int main() {
    int n;
    cin >> n;
    vector<bool> r(n + 1);
    vector<int> v(n + 1);
    cout << recur(n, r, v) << endl;
    return 1;
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: RUNTIME ERROR