hdu5459 Jesus Is Here
来源:互联网 发布:菜鸟数据分析 编辑:程序博客网 时间:2024/05/22 12:14
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这题主要是推公式,记c[i]为c字符的个数,s[i]为c字符的坐标和,n[i]为所有字符的总个数,f[i]表示求的距离差。
那么f[i]=(c[i-2]*n[i-2]-s[i-2])*c[i-1]+c[i-2]*s[i-1];其中c[i-2]*n[i-2]-s[i-2]为所有c前半部分到合并中间的距离和。
#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<string>#include<algorithm>using namespace std;#define ll long long#define inf 0x7fffffff#define mod 530600414#define maxn 201316ll f[maxn],c[maxn],s[maxn],n[maxn];void init(){ int i,j; c[3]=1;s[3]=1;n[3]=3;f[3]=0; c[4]=1;s[4]=3;n[4]=5;f[4]=0; for(i=5;i<=201314;i++){ f[i]=(f[i-1]+f[i-2]+ ( (c[i-2]*n[i-2]-s[i-2])%mod )*c[i-1]%mod+c[i-2]*s[i-1]%mod )%mod; n[i]=(n[i-1]+n[i-2])%mod; c[i]=(c[i-1]+c[i-2])%mod; s[i]=( (s[i-2]+ s[i-1])%mod+(n[i-2]*c[i-1])%mod )%mod; }}int main(){ int m,i,j,T,num1=0,d; scanf("%d",&T); init(); while(T--) { scanf("%d",&d); num1++; printf("Case #%d: %lld\n",num1,f[d]); } return 0;}
0 0
- hdu5459 Jesus Is Here
- HDU5459 Jesus Is Here
- hdu5459 Jesus Is Here 递推
- hdu5459 Jesus Is Here(沈阳网赛)
- Jesus Is Here HDU
- Jesus Is Here HDU
- 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
- HDU 5459 Jesus Is Here(递推)
- hdu 5459 Jesus Is Here(dp)
- HDU 5459 Jesus Is Here dp+预处理
- hdu 5459 Jesus Is Here(推公式)
- Jesus Is Here(区域赛网络赛选拔)
- hdoj 5459 Jesus Is Here 【求公式 递推】
- java.lang.string
- android基础入门
- JAVA学习笔记
- 批量删除当前目录下后缀名为.c的文件。如a.c、b.c。
- 手机和电脑使用局域网传数据
- hdu5459 Jesus Is Here
- Move Zeroes
- 在屏幕特定位置点击隐藏子窗口
- javaScript正则表达式相关函数的使用
- Unity3d快捷键
- 软件生命周期
- 并发队列ConcurrentLinkedQueue和阻塞队列LinkedBlockingQueue用法 在Java多线程应用中,队列的使用率很高,多数生产消费模型的首选数据结构就是队列(先进先出)。
- 简易新浪微博客户端--Sweetheart
- 菜单