HDU 5459 Jesus Is Here

#include <stdio.h>
#define ll long long
#define maxn 201314
#define mod 530600414
ll dis[maxn+5], len[maxn+5], cnt[maxn+5], sum[maxn+5];
void init(){
len[1] = cnt[1] = 1;
dis[1] = sum[1] = 0;

len[2] = 2, cnt[2] = 0;
dis[2] = sum[2] = 0;

for(int i = 3;i <= maxn;i++){
dis[i] = (dis[i - 2] + dis[i - 1] + cnt[i - 1] * len[i - 2] % mod) % mod;
len[i] = (len[i - 1] + len[i - 2]) % mod;
cnt[i] = (cnt[i - 1] + cnt[i - 2]) % mod;
ll add = cnt[i - 2] * (dis[i - 1] + cnt[i - 1] * len[i - 2] % mod) %mod;
ll del = cnt[i - 1] * dis[i - 2] % mod;
sum[i] = ((sum[i - 1] + sum[i - 2] + add - del) % mod + mod) % mod;
}
}
int main()
{
init();
int t, n;
scanf("%d", &t);
for(int i = 1;i <= t;i++){
scanf("%d", &n);
printf("Case #%d: %lld\n", i, sum
);
}
return 0;
}