HDOJ 5459 Jesus Is Here(打表规律)
来源:互联网 发布:中国人工智能产品 编辑:程序博客网 时间:2024/05/29 17:33
Jesus Is Here
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 405 Accepted Submission(s): 290
Problem Description
I've sent Fang Fang around 201314 text messages in almost 5 years. Why can't she make sense of what I mean?
``But Jesus is here!" the priest intoned. ``Show me your messages."
Fine, the first message iss1=‘‘c" and the second one is s2=‘‘ff" .
Thei -th message is si=si−2+si−1 afterwards. Let me give you some examples.
s3=‘‘cff" ,s4=‘‘ffcff" and s5=‘‘cffffcff" .
``I found thei -th message's utterly charming," Jesus said.
``Look at the fifth message".s5=‘‘cffffcff" and two ‘‘cff" appear in it.
The distance between the first‘‘cff" and the second one we said, is 5 .
``You are right, my friend," Jesus said. ``Love is patient, love is kind.
It does not envy, it does not boast, it is not proud. It does not dishonor others, it is not self-seeking, it is not easily angered, it keeps no record of wrongs.
Love does not delight in evil but rejoices with the truth.
It always protects, always trusts, always hopes, always perseveres."
Listen - look at him in the eye. I will find you, and count the sum of distance between each two different‘‘cff" as substrings of the message.
``But Jesus is here!" the priest intoned. ``Show me your messages."
Fine, the first message is
The
``I found the
``Look at the fifth message".
The distance between the first
``You are right, my friend," Jesus said. ``Love is patient, love is kind.
It does not envy, it does not boast, it is not proud. It does not dishonor others, it is not self-seeking, it is not easily angered, it keeps no record of wrongs.
Love does not delight in evil but rejoices with the truth.
It always protects, always trusts, always hopes, always perseveres."
Listen - look at him in the eye. I will find you, and count the sum of distance between each two different
Input
An integer T (1≤T≤100) , indicating there are T test cases.
FollowingT lines, each line contain an integer n (3≤n≤201314) , as the identifier of message.
Following
Output
The output contains exactly T lines.
Each line contains an integer equaling to:
∑i<j:sn[i..i+2]=sn[j..j+2]=‘‘cff"(j−i) mod 530600414,
wheresn as a string corresponding to the n -th message.
Each line contains an integer equaling to:
where
Sample Input
956781131205199312199401201314
Sample Output
Case #1: 5Case #2: 16Case #3: 88Case #4: 352Case #5: 318505405Case #6: 391786781Case #7: 133875314Case #8: 83347132Case #9: 16520782开始看就感觉不会那么简单,暴力一写果然超时,应该是规律,但是实在是没找到,看到别人的规律,秒懂,哎.....ac代码:#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#define MAXN 210000#define MOD 530600414using namespace std;long long len[MAXN],pos[MAXN],sum[MAXN],num[MAXN];void db(){ len[5]=8;len[6]=13; num[5]=2;num[6]=3; pos[5]=7;pos[6]=20; sum[5]=5;sum[6]=16; for(int i=7;i<MAXN;i++) { len[i]=(len[i-2]+len[i-1])%MOD; num[i]=(num[i-2]+num[i-1])%MOD; pos[i]=(pos[i-1]+pos[i-2]+(len[i-2]*num[i-1])%MOD)%MOD; sum[i]=(sum[i-1]+sum[i-2]+(((len[i-2]*num[i-2]-pos[i-2]))%MOD*num[i-1])%MOD+(pos[i-1]*num[i-2])%MOD)%MOD; }}int main(){ db(); int t; int n; int cas=0; scanf("%d",&t); while(t--) { scanf("%d",&n); printf("Case #%d: %lld\n",++cas,sum[n]); } return 0;}
0 0
- HDOJ 5459 Jesus Is Here(打表规律)
- HDU 5459 Jesus Is Here(DP)
- hdu 5459 Jesus Is Here(dp)
- hdoj 5459 Jesus Is Here 【求公式 递推】
- HDU 5459 Jesus Is Here
- HDU 5459 Jesus Is Here
- HDU 5459 Jesus Is Here
- 【递推】 HDU 5459 Jesus Is Here
- HDU 5459 Jesus Is Here(递推)
- HDU 5459 Jesus Is Here dp+预处理
- hdu 5459 Jesus Is Here(推公式)
- HDU_5459 Jesus Is Here(递推)
- hdu5459 Jesus Is Here
- Jesus Is Here HDU
- Jesus Is Here HDU
- HDU5459 Jesus Is Here
- HDU 5459 Jesus Is Here(斐波那契递推 取模)
- HDU-5459 Jesus Is Here(2015沈阳网赛,递推,思路)
- leetcode 104.Maximum Depth of Binary Tree-树的深度|递归
- leetcode题目 反转链表系列问题
- HDU 5130 Signal Interference (2014年广州赛区现场赛D题)
- ubuntu默认root密码
- hdu 5495 LCS dfs
- HDOJ 5459 Jesus Is Here(打表规律)
- java高并发解决方案
- html编码
- Android UI ActionBar功能-自定义Tab功能
- 【读书笔记】iOS-GCD-Dispatch Queue
- 解决 PL/SQL developer客户端与Oracel 11G服务端字体不同的办法
- java编程思想-接口
- Eclipse之各个版本的区别
- 文章标题