Dice Combinations

#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n;
	cin >> n;

	vector<int> count(n, 0);
	int dice_values[] = { 1, 2, 3, 4, 5, 6 };
	count[0] = 1;
	int m = 1000000007;
	for (int x = 1; x <= n; x++) {
		for (auto c : dice_values) {
			if (x - c >= 0) {
				count[x] += count[x - c];
				count[x] %= m;
			}
		}
	}

	cout << count[n] << "\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: 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