Dice Summation

#include <bits/stdc++.h>

using namespace std;

/*
Your task is to count the number of ways to construct sum n by throwing a dice one or more times. Each throw produces an outcome between 1 and  6.
For example, if n=3, there are 4 ways:

1+1+1
1+2
2+1
3

Input
The only input line has an integer n.
Output
Print the number of ways modulo 10^9+7.
*/

int dice(int n, long long &MOD) {
    if (n == 0)
        return 0;
    else if (n == 1)
        return 1;
    else {
        vector<int> ways(n + 1, 0);
        ways[0] = 1;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= 6; ++j) {
                if (i - j >= 0) {
                    ways[i] = (ways[i] + ways[i - j]) % MOD;
                }
            }
        }
        return ways[n]; 
    }
}

int main()
{
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);

    int n;
    cin >> n;

    long long MOD = 1e9 + 7;

    cout << dice(n, MOD) << 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