# Simpsons’ Hidden Talents

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

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

#include<stdio.h>
#include<string.h>
char str1[50005],str2[50005];
int next[50005];
void get_next()
{
int len=strlen(str1),i,j;

next[0]=j=-1;
for(i=0;i<len;)
{
if(j==-1||str1[i]==str1[j]) next[++i]=++j;
else j=next[j];
}
}
int solve()
{
int len1=strlen(str1),len2=strlen(str2);
int i,j=0;

for(i=0;i<len2;)
{
if(j==-1||str2[i]==str1[j])
{
j++,i++;
if(j==len1&&i!=len2) j=next[j];
}
else j=next[j];
}

return j;
}
int main()
{
int res;

while(gets(str1)>0)
{
gets(str2);
if(str1[0]=='\0'&&str2[0]=='\0')
{
printf("0\n");
continue;
}
get_next();
res=solve();
str1[res]='\0';
if(res) printf("%s %d\n",str1,res);
else printf("0\n");
}

return 0;
}


• 本文已收录于以下专栏：

## hdoj 2594 Simpsons’ Hidden Talents 【KMP】【求串的最长公共前缀后缀】

Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (J...
• chenzhenyu123456
• 2015年08月18日 09:00
• 928

## HDU2594——Simpsons’ Hidden Talents

Problem Description Homer: Marge, I just figured out a way to discover some of the talents we weren...
• bingsanchun1
• 2013年08月20日 00:59
• 1830

## HDU-2549 Simpsons’ Hidden Talents

• wl16wzl
• 2018年01月16日 19:33
• 14

## Homer Simpson+uva+01背包

Homer Simpson Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu...
• u012870383
• 2014年09月24日 20:18
• 361

## KMP题目

A - Sum Problem Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit...
• Geecky
• 2016年08月24日 10:16
• 418

## HDU 2594Simpsons’ Hidden Talents(KMP运用)

Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java...
• opm777
• 2013年08月03日 17:04
• 984

## HDU 2594 Simpsons’ HiddenTalents(KMP:后缀与前缀)

HDU 2594 Simpsons’ HiddenTalents(KMP:后缀与前缀) http://acm.hdu.edu.cn/showproblem.php?pid=2594 题意:给定两个串S...
• u013480600
• 2014年04月05日 15:48
• 751

## HDU 2594

http://acm.hdu.edu.cn/showproblem.php?pid=2594Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java...
• u013077144
• 2016年04月21日 18:57
• 106

## hdu 4691 最长公共前缀 后缀数组 +lcp+rmq

http://acm.hdu.edu.cn/showproblem.php?pid=4691 去年暑假多校赛的题，当时还不会后缀数组 现在会了，其实自己组合后缀数组跟rmq还是对的，但是题意理解有问题...
• u011026968
• 2014年06月17日 22:40
• 1244

## 【KMP】 HDU 2594 Simpsons’ Hidden Talents

• u012749539
• 2015年03月03日 22:50
• 363

举报原因： 您举报文章：hdu 2594 Simpsons’ Hidden Talents（KMP） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)