Dice Combinations

#include<iostream>
#include<vector>

using namespace std;


int solve( vector<int> & ways, int n){
    ways[0] = 1;
    for(int x = 1; x <= n; x++){
        for(int d = 1; d <= 6; ++d){
            if(x - d >= 0)
                ways[x]=(ways[x] + (ways[x-d])) % 1000000007;
        }
    }
    return ways[n];
}
int main(){
    int n;
    cin >> n;

    vector<int>  ways(n,0);
    cout<<solve(ways,n)<<endl;


}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: RUNTIME ERROR

malloc(): corrupted top size

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