HDU 5459 Jesus Is Here

最新推荐文章于 2020-09-04 18:41:59 发布

mitic

最新推荐文章于 2020-09-04 18:41:59 发布

阅读量464

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/mitic/article/details/48576931

版权

ACM 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

HDU 5459 Jesus Is Here

/**
http://acm.hdu.edu.cn/showproblem.php?pid=5459
HDU 5459 Jesus Is Here

*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
#define ll __int64
using namespace std;
#define maxn 201315
ll pre[maxn];
ll aend[maxn];
ll ans[maxn]={0};
ll num[maxn];
ll len[maxn];
const ll mod = 530600414;
void Init(){
    pre[4]=3;
    aend[4]=2;
    ans[4]=0;
    num[4]=1;
    len[4]=5;
    pre[5]=7;
    aend[5]=9;
    ans[5]=5;
    num[5]=2;
    len[5]=8;
    for(int i=6;i<maxn;i++){
        pre[i]=pre[i-1]+pre[i-2]+len[i-2]*num[i-1];
        aend[i]=aend[i-1]+aend[i-2]+len[i-1]*num[i-2];
        ans[i]=ans[i-1]+ans[i-2]+pre[i-1]*num[i-2]+aend[i-2]*num[i-1];
        num[i]=num[i-1]+num[i-2];
        len[i]=len[i-1]+len[i-2];
        pre[i]%=mod;
        aend[i]%=mod;
        ans[i]%=mod;
        num[i]%=mod;
        len[i]%=mod;
    }
}
int main(){
    int T,n;
    scanf("%d",&T);
    Init();
    for(int h=1;h<=T;h++){
        scanf("%d",&n);
        printf("Case #%d: %I64d\n",h,ans[n]);
    }
    return 0;
}