Dice Summation

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

const int MAXN = 1e6+1;
int ar[MAXN];

const int mod = 1e9 + 7;

int main () {
    // freopen("input.txt", "r", stdin);

    const int D = 6;

    int n;
    cin >> n;

    ar[0] = 1;

    for (int i = 1; i <= n; i++) {
        ar[i] = 0;
        for (int j = 1; j <= D; j++) {
            if (i - j >= 0) ar[i] = (ar[i] + ar[i-j]) % mod;
        }
    }

    cout << ar[n] % mod << '\n';

    return 0;
}

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