#include<stdio.h>
const int mod=1000000000;
int s[1000009];
int main()
{
int max,n,m,i;
s[0]=1;
s[1]=1;
for(i=2;i<=1000000;i++){
if(i%2==0)
s[i]=(s[i/2]+s[i-2])%mod;
else
s[i]=s[i-1];
}
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&m);
printf("%d\n",s[m]);
}
return 0;
}
ZCMU 1225: Give me the answer
最新推荐文章于 2024-10-13 17:13:37 发布