Dice Combinations

#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n;
    cin >> n;
    vector<long> combinations(n + 1);

    combinations[0] = 1;
    for (int k = 1; k <= n; k++)
    {
        for (int dice = 1; dice <= 6; dice++)
        {
            if (k - dice >= 0)
            {
                combinations[k] += combinations[k - dice];
                combinations[k] %= MOD;
            }
        }
    }
    cout << combinations[n] << "\n";
}

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