Submission #50069466

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) for (int i = (int)(n); i >= 0; i--)
#define itrep(itr, stl) for (auto itr = stl.begin(); itr != stl.end(); itr++)
#define Vec2D(type, n, m, val) vector<vector<type>>(n, vector<type>(m, val))
#define print(x) cout << x << endl
#define all(a) a.begin(), a.end()
const int INF = LLONG_MAX;
const int N_INF = LLONG_MIN;
using namespace std;

int MOD = 10007;

void solve() {
    int n, k = 3;
    cin >> n;
    // cin >> k; 
    vector<int> a(n, 0);
    a[k-1] = 1;
    int sum = 1;

    for(int i = k; i < n; i++) {
        a[i] = sum;

        sum += MOD + a[i] - a[i-k];
        sum %= MOD;
    }
    
    cout << a[n-1] << endl;
}

signed main() {
    std::cout << std::fixed;
    std::cout << std::setprecision(20);
    std::cin.tie(0)->sync_with_stdio(0);
    int times = 1;
    // cin >> times;
    while (times--) solve();
    return 0;
}

Submission Info

Judge Result