帮帮$蒟蒻$吧

题目

#include<bits/stdc++.h>
using namespace std;
long long a[1014514]={0,1,1,0,0,0};
int fibo(int n){
	if(n==1||n==2)return 1;
	a[2]=1;
	a[3]=1;
	for(int i=3;i<=n;i++)a[i]=a[i-1]+a[i-2];
	return a[n]%1000;
}
int t,ds;
int main(){
	cin>>t;
	while(t--){
		cin>>ds;
		cout<<fibo(ds)<<endl;
	}
}