Hdu2594 -- Simpsons 'den den Talents

Problem descriptionhomer: 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: Riann and Marjorie gives 3 !!!
MARGE: Who the heck is Riann?
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.

Inputinput consists of two lines. The first line contains S1 and the second line contains S2. you may assume all letters are in lowercase.

Outputoutput 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 shocould be 0.
The lengths of S1 and S2 will be at most 50000.

Sample Input

Clintonhomerriemannmarjorie
 

Sample output

 
0rie 3
 

Analysis: For the two strings S1 and S2, obtain the longest string that is the prefix of S1 and is the suffix of S2.

# Include <iostream> # include <string. h> # include <stdio. h> # include <ctype. h> # include <algorithm> # include <stack> # include <queue> # include <set> # include <math. h> # include <vector> # include <map> # include <deque> # include <list> using namespace STD; char a [50009], B [50009]; int next [50009]; int M, N; int I, j; void getnext () {int I = 0; Int J =-1; next [0] =-1; while (I <n) {If (j =-1 | B [I] = B [J]) {I ++; j ++; if (B [I]! = B [J]) next [I] = J; else next [I] = next [J];} else J = next [J];} int KMP () {int I = 0; Int J = 0; while (I <m) {If (j =-1 | A [I] = B [J]) {I ++; j ++;} else {J = next [J] ;}} return J ;}int main () {While (gets (B )) {gets (a); M = strlen (a); n = strlen (B); getnext (); int P = KMP (); For (INT I = 0; I <p; I ++) printf ("% C", B [I]); If (p) printf (""); printf ("% d \ n ", p);} return 0 ;}