Substrings
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 12072
Accepted: 4233
Description
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings.
Input
The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each......
阅读全文