Maximum time limit of the reply substring: 1000 MS | memory limit: 65535 KB difficulty: 4
-
Description
-
Enter a string to obtain the longest substring. The meaning of a substring is the continuous string fragment of the original string. The meaning of the reply is: Reading and viewing are the same, such as Abba and abbebba. All punctuation marks and spaces must be ignored and case-insensitive. However, output is as-is (no extra strings should be output at the beginning and end of the output ). The length of the input string is greater than or equal to 1 and less than or equal to 5000, and occupies a single row (if there are multiple groups of answers, output the first group ).
-
Input
-
Enter a test data N (1 <=n <= 10 );
Then there are n rows, each row has a string.
-
Output
-
Output the required response substring.
-
Sample Input
-
1 confuciuss say: Madam, I'm Adam.
-
Sample output
-
Madam, I'm Adam
-
-
Longest reply substring
