如果使用递归的话会超时,用数组最好
代码如下
#include<cstdio>
#include<iostream>
using namespace std;
int s[1000005];
int main() {
int n,i,r=10007;;
s[1] = 1;
s[2] = 1;
for(i=3; i<=1000000; i++) s[i] = (s[i-1]+s[i-2]) %r;
while(~scanf("%d",&n)) {
printf("%d\n",s[n]);
}
return 0;
}