Dice Combinations

/*
    Road to Freedom
*/

#include <bits/stdc++.h>

using namespace std;

#define ll long long int
#define F first
#define S second
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpi vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<int, int>
#define mpi map<pii, int>
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int)x.size())
#define all(p) p.begin(), p.end()
#define double long double
#define que_max priority_queue<int>
#define que_min priority_queue<int, vi, greater<int>>
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define print(a)          \
    for (auto x : a)      \
        cout << x << " "; \
    cout << endl
#define print1(a)    \
    for (auto x : a) \
    cout << x.F << " " << x.S << endl
#define print2(a, x, y)         \
    for (int i = x; i < y; i++) \
        cout << a[i] << " ";    \
    cout << endl
#define REP(i, a, b) for (int i = a; i <= b; i++)

inline int power(int a, int b)
{
    int x = 1;
    while (b)
    {
        if (b & 1)
            x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}

template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args)
{
    const char *comma = strchr(names + 1, ',');
    cout.write(names, comma - names) << " : " << arg1 << " | ";
    __f(comma + 1, args...);
}

const int N = 200005;
const ll MOD = 10e9 + 7;
void solve()
{
    int n;
    cin >> n;
    ll dp[n + 10];
    memset(dp, 0, sizeof(dp));
    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 2;
    if (n <= 2)
    {
        cout << dp[n];
        return;
    }
    for (int i = 3; i <= n; i++)
    {
        for (int j = 0; j < i; j++)
        {
            dp[i] += (dp[j] % MOD);
            // dp[i] = dp[i] % MOD;
        }
    }
    cout << dp[n];
    return;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    clock_t z = clock();

    int t = 1;
    // cin >> t;
    while (t--)
        solve();

    cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

    return 0;
}

Test 1

Verdict: ACCEPTED

Run Time : 3.4e-05

Test 2

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 3

Verdict: ACCEPTED

Run Time : 3.6e-05

Test 4

Verdict: ACCEPTED

Run Time : 3.7e-05

Test 5

Verdict: ACCEPTED

Run Time : 3.6e-05

Test 6

Verdict: ACCEPTED

Run Time : 3.5e-05

Test 7

Verdict: WRONG ANSWER

Run Time : 3.6e-05

Test 8

Verdict: WRONG ANSWER

Run Time : 3.6e-05

Test 9

Verdict: WRONG ANSWER

Run Time : 3.7e-05

Test 10

Verdict: WRONG ANSWER

Run Time : 3.5e-05

Test 11

Verdict: WRONG ANSWER

Run Time : 3.9e-05

Test 12

Verdict: WRONG ANSWER

Run Time : 0.000792

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

Run Time : 0.00079

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: WRONG ANSWER

Run Time : 3.8e-05