Submission #2388260

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
using namespace std;

#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define rep2(i,j,n) for(int i=(j);i<=(n);i++)
#define all(i) i.begin(),i.end()

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef pair<int, int> pi;
typedef long long i64;

int main() {
	int n;
	cin >> n;
	vi a(n + 1, 0);
	if (n >= 3) {
		a[3] = 1;
		rep2(i, 4, n) {
			a[i] = (a[i - 1] + a[i - 2] + a[i - 3]) % 10007;
		}
	}
	cout << a[n] << endl;
	return 0;
}

Submission Info

Judge Result