Dice Combinations

#include <iostream>
#include <vector>
using namespace std;

const int MOD = 1e9+7;
int main() {
    int n;
    cin >> n;
    vector<int> dp(n+1);
    dp[1] = 1;
    for (int i = 2; i <= n; i++){
        if (i <= 6){
            dp[i] = dp[i-1] * 2;
        } else {
            dp[i] = (dp[i-1] * 2 - 1) % MOD;
        }
    }
    cout << dp[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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

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