Dice Combinations

#include <iostream>
#include <math.h>
 
int MOD = 1000000007;
 
int helper(int n, int * done, int * memory){
	if(n == 0){
		return 1;
	}
	if(done[n] == true){
		return memory[n];
	}
	
	int ans = 0;
	for(int i = 1; i < 7; i++){
		if (n - i < 0) break;
		ans += helper(n-i, done, memory) % MOD;
	}
	ans = ans % MOD;
	done[n] = true;
	memory[n] = ans;
	return ans;
}
 
int main(){
	int n;
	std::cin >> n;
	int done[n+1];
	int memory[n+1];
	for (int i = 0; i < n + 1; i++){
		done[i] = false;
		memory[i] = 0;
	}
	int ans = helper(n, done, memory);
	std::cout << ans;
	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: 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