BEGIN-4 Fibonacci数列

• 递推公式 f[n]=(f[n-1]+f[n-2])%mod,(n>3);

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const int N=1e6+9;
const double PI=acos(-1);
const int mod=10007;
#define line '\n'
#define gt getchar()
#define mid ((L+R)>>1)
int read(){int x=0,op=1;char c=gt;while(!isdigit(c)){if(c=='-')op=-1;c=gt;}while(isdigit(c))x=x*10+c-48,c=gt;return x*op;}
int f[N];
int main()
{
	f[1]=f[2]=1;
	int n=read();
	for(int i=3;i<=n;++i)f[i]=(f[i-1]+f[i-2])%mod;
	cout<<f[n]<<line;
	return 0;
}