Dice Combinations

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int MOD = 1e9 + 7;

int recursive_dice(int sum, vector<int>& count){
    if(sum < 0) return 0;
    if(sum == 0) return count[0];
    if(count[sum] != 0) return count[sum];
    else{
        for(int i = 1; i < 7; i++){
            count[sum] += recursive_dice(sum - i, count);
            count[sum] %= MOD;
        }
        return count[sum];
    }
}

int main(){
    int n;
    cin >> n;
    vector<int> count(n+1, 0);
    count[0] = 1;
    cout << recursive_dice(n, count) << 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