2015 ACM/ICPC 沈阳赛区网络赛 1010.Jesus Is Here (HDOJ5459)

#include<stdio.h>
#define N 250000
#define mod 530600414
long long a
,b
,c
,d
,s
,k
,v
;
int main(){
s[3]=0;
s[4]=0;
s[5]=5;	a[5]=5;	b[5]=0;	c[5]=2;	d[5]=5; k[5]=0,v[5]=5;
s[6]=16;a[6]=11; b[6]=5;	c[6]=3;	d[6]=13; k[6]=2,v[6]=8;
for(int i=7;i<=201314;i++){
b[i]=a[i-1]*c[i-2]%mod+d[i-2]*c[i-1]%mod+(k[i-1]+3)*c[i-2]*c[i-1]%mod;
s[i]=(s[i-1]+s[i-2]+b[i])%mod;

a[i]=(a[i-2]+a[i-1]+v[i-2]*c[i-1]%mod+(k[i-1]+3)*c[i-1]%mod)%mod;
d[i]=(d[i-1]+d[i-2]+v[i-1]*c[i-2]%mod+(k[i-1]+3)*c[i-2])%mod;
v[i]=(v[i-1]+v[i-2]+k[i-1]+3)%mod;
k[i]=k[i-2];
c[i]=(c[i-1]+c[i-2])%mod;

//printf("%I64d\n",i,s[i]);
}
int T;
scanf("%d",&T);
int n;
int cas=1;
while(T--){
scanf("%d",&n);
printf("Case #%d: %I64d\n",cas++,s
);
}
}