#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1000005;
int d[maxn];
int main(void){
int T;
cin>>T;
d[1]=d[2]=1;
int i=3;
while(T--){
int n;
cin>>n;
for(;i<=n;i++)
d[i]=(d[i-1]+d[i-2])%1000;
cout<<d[n]<<endl;
}
return 0;
}
斐波那契数列递推
猜你喜欢
转载自blog.csdn.net/qq_38060122/article/details/78699713
今日推荐
周排行