Submission #4026292

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
const static long long int MOD = 1000000000 + 7;
const static int dy[] = {0, 1, 0, -1};
const static int dx[] = {1, 0, -1, 0};

int main(int argc, char *argv[]) {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int trib_0 = 0;
    int trib_1 = 0;
    int trib_2 = 1;
    if (n == 1 || n == 2) {
        cout << 0 << endl;
        return 0;
    } else if (n == 3) {
        cout << 1 << endl;
        return 0;
    }

    int trib;
    for (int i = 3; i < n; ++i) {
        trib = (trib_0 + trib_1+ trib_2) % 10007;
        trib_0 = trib_1 % 10007;
        trib_1 = trib_2 % 10007;
        trib_2 = trib % 10007;
    }

    cout << trib << endl;
    return 0;
}

Submission Info

Judge Result