Dice Summation

#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

ll pos(vector<int>& sol, int n){
    if(n==0) return 1;
    if(sol[n]!=-1)return sol[n];

    ll te=0;
    for(int i=0;i<n; i++){
        te += pos(sol, i);
    }
    sol[n]=te;
    return te;
}

int main(){
    int n;
    cin >> n;

    vector<int> sol(n+1,-1);
    cout << pos(sol, 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: ACCEPTED

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: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: WRONG ANSWER