hduoj------2594 Simpsons’ Hidden Talents

Simpsons’ Hidden Talents

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2875    Accepted Submission(s): 1095

Problem Description

Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me for example. I want to find out if I have a talent in politics, OK? Marge: OK. Homer: So I take some politician’s name, say Clinton, and try to find the length of the longest prefix in Clinton’s name that is a suffix in my name. That’s how close I am to being a politician like Clinton Marge: Why on earth choose the longest prefix that is a suffix??? Homer: Well, our talents are deeply hidden within ourselves, Marge. Marge: So how close are you? Homer: 0! Marge: I’m not surprised. Homer: But you know, you must have some real math talent hidden deep in you. Marge: How come? Homer: Riemann and Marjorie gives 3!!! Marge: Who the heck is Riemann? Homer: Never mind. Write a program that, when given strings s1 and s2, finds the longest prefix of s1 that is a suffix of s2.

Input

Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.

Output

Output consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0. The lengths of s1 and s2 will be at most 50000.

Sample Input

clinton homer riemann marjorie

Sample Output

0 rie 3

Source

HDU 2010-05 Programming Contest

 简单的kmp。。。

代码:

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdlib>
 4 using namespace std;
 5 const int maxn=50050;
 6 char str[maxn],st[maxn];
 7 int next[maxn];
 8 int main()
 9 {
10     while(gets(str)!=NULL)
11     {
12         gets(st);
13         int lena=strlen(str);
14         int lenb=strlen(st);
15         int i=0,j=-1;
16         next[0]=-1;
17         while(i<lena)
18         {
19             if(j==-1||str[i]==str[j])
20               next[++i]=++j;
21             else j=next[j];
22         }
23         i=j=0;
24         while(i<lenb)
25         {
26             if(j==-1||str[j]==st[i])
27             {
28               i++;
29               j++;
30             }
31            else  j=next[j];
32         }
33         if(j==0) printf("0\n");
34         else
35         printf("%s %d\n",st+lenb-j,j);;
36     }
37 
38 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏ml

HDUOJ--1865 1string

1sting Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Ja...

23460
来自专栏ml

HDUOJ -----1686

Oulipo Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Ja...

33370
来自专栏吾真本

CYBER-DOJO.ORG上的编程操练题目100 doorsAnagramsBalanced ParenthesesBowling GameCalc StatsCombined NumberCoun

Cyber-dojo.org是编程操练者的乐园。下面是这个网站上的43个编程操练题目,供编程操练爱好者参考。

49120
来自专栏ml

hdu-----(1507)Uncle Tom's Inherited Land*(二分匹配)

Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others)    Memory Lim...

26540
来自专栏ml

hdu----(5045)Contest(数位dp)

Contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (J...

36450
来自专栏ml

2014---多校训练2(ZCC Loves Codefires)

ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 3276...

29050
来自专栏ml

HDUOJ---What Are You Talking About

What Are You Talking About Time Limit: 10000/5000 MS (Java/Others)    Memory Lim...

402140
来自专栏算法修养

POJ-2039 To and Fro

To and Fro Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8...

22140
来自专栏算法修养

ZOJ 3607 Lazier Salesgirl (枚举)

Lazier Salesgirl Time Limit: 2 Seconds Memory Limit: 65536 KB Kochiya S...

37670
来自专栏ml

HDUOJ--1159Common Subsequence

Common Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536...

27470

扫码关注云+社区

领取腾讯云代金券