Submission #1816396

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define p pair<int,int>
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
using namespace std;
int POW(int x,int y){return int(pow(double(x),double(y)));}


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

}

Submission Info

Judge Result