Fibonacci数列
#include<stdio.h>
int main()
{
int i,f1=1,f2=1,f3=1,n;
scanf("%d",&n);
if(n>2)
for(i=3;i<=n;i++){
f3=(f1+f2)%10007;
f1=f2;
f2=f3;
}
printf("%d",f3);
return 0;
}
#include<stdio.h>
#define MAX 1000001
#define YU 10007
int n,i,f[MAX];
int main(){
scanf("%d",&n);
f[1]=1;
f[2]=2;
for(i=3;i<=n;i++){
f[i]=(f[i-1]+f[i-2])%YU;
}
printf("%d\n",f[n]);
return 0;
}