Description

• Input two strings, and find the longest common substring of two strings.

• There is only one longest common substring.

• The length of two strings are less than 1000.

Input

• Input: Two strings

• Input format: See the sample I/O

Output

• Output: A substring.

• Output format:  Change a new line at the end. 

Sample Input  Download

Sample Output  Download

Tags

Add Tag

Discuss