HDU--杭电--4300--Clairewd’s message--KMP--KMP的灵活运用
来源:互联网 发布:泰国佛牌 知乎 编辑:程序博客网 时间:2024/06/03 15:01
Clairewd’s message
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2564 Accepted Submission(s): 1006
Unfortunately, GFW(someone's name, not what you just think about) has detected their action. He also got their conversion table by some unknown methods before. Clairewd was so clever and vigilant that when she realized that somebody was monitoring their action, she just stopped transmitting messages.
But GFW knows that Clairewd would always firstly send the ciphertext and then plaintext(Note that they won't overlap each other). But he doesn't know how to separate the text because he has no idea about the whole message. However, he thinks that recovering the shortest possible text is not a hard task for you.
Now GFW will give you the intercepted text and the conversion table. You should help him work out this problem.
Each test case contains two lines. The first line of each test case is the conversion table S. S[i] is the ith latin letter's cryptographic letter. The second line is the intercepted text which has n letters that you should recover. It is possible that the text is complete.
T<= 100 ;
n<= 100000;
2abcdefghijklmnopqrstuvwxyzabcdabqwertyuiopasdfghjklzxcvbnmqwertabcde
abcdabcdqwertabcde
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int next[111111];
char a[333],s[111111],ss[55555];
void getnext(int l) //求next数组
{
int i=0,j=-1;next[i]=j;
while(i<l)
if(j==-1||s[i]==s[j])next[++i]=++j;
else j=next[j];
}
int kmp(char s1[],char s2[],int l1,int l2) //用s2匹配s1
{
int i=0,j=0;
while(i<l1&&j<l2)
if(j==-1||s1[i]==a[s2[j]])i++,j++;
else j=next[j];
return j; //返回s2已经匹配的后一个下标
}
int main (void)
{
int n,i,k,l;
char c;
scanf("%d%*c",&n);
while(n--)
{
memset(next,0,sizeof(next));
for(i='a';i<='z';i++)
scanf("%c",&c),a[c]=i;
getchar();
scanf("%s%*c",s);
l=strlen(s);
strcpy(ss,s+(l+1)/2); //把后一半可能带有密文的明文装入ss
getnext(l); //求输入的密文明文混合体的next
k=kmp(ss,s,strlen(ss),l); //得到匹配成功的长度,即里面存在的明文的长度
i=l;l-=2*k;
while(l--)
{
s[i]=a[s[k]];
i++;k++;
}
s[i]='\0';
puts(s);
}
}
- HDU--杭电--4300--Clairewd’s message--KMP--KMP的灵活运用
- hdu 4300 Clairewd’s message 扩展kmp
- hdu - 4300 - Clairewd’s message- kmp
- HDU 4300 Clairewd’s message(拓展KMP)
- hdu 4300 Clairewd’s message(扩展KMP)
- KMP hdu-4300 Clairewd’s message
- HDU 4300 Clairewd’s message KMP
- hdu 4300 Clairewd’s message(KMP)
- hdu 4300 Clairewd’s message(KMP)
- hdu 4300 Clairewd’s message (KMP)
- HDU 4300 Clairewd’s message(扩展KMP)
- hdu 4300 Clairewd’s message KMP算法
- hdu 4300 Clairewd’s message (KMP)
- hdu 4300 Clairewd’s message (kmp)
- hdu 4300 Clairewd’s message (扩展kmp)
- hdu 4300 Clairewd’s message (kmp)
- HDU 4300 Clairewd’s message(KMP)
- hdu 4300 Clairewd’s message (kmp)
- [小说]魔王冢(17)鬼金羊
- 用户权限系统的URL整合方法剖析
- strcasecmp 函数 与 strncasecmp函数的介绍
- 怎样在继承自BaseAdapter类的adapter中使用Intent跳转到另一个activity
- 对比iOS网络组件:AFNetworking VS ASIHTTPRequest
- HDU--杭电--4300--Clairewd’s message--KMP--KMP的灵活运用
- android基础篇------------java基础(10)(IO)
- 内部类(闭包与回调)
- 可变数组的数据添加
- hdu2602 Bone Collector
- 让数据库变快的10个建议
- Disabling the flood of kernel messages in Debian console
- 深入分析:Flash VS HTML5到底谁统江山
- 关于二维数组做参数问题