Dice Combinations

#include <iostream>
#include <math.h>

using namespace std;

int main() {
    int n;
    cin >> n;
    int count[n] = {0};
    int dice[6] = {1,2,3,4,5,6};
    long m = pow(10, 9) + 7;


    count[0] = 1;
    for (int x = 1; x <= n; x++) {
        for (auto d : dice) {
            if (x-d >= 0) {
                count[x] += count[x-d];
                count[x] %= m;
            }
        }
    }
    cout << count[n];
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER