hdu1238（Substrings）

题目描述：
Problem 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 file 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 test case contains a single integer n (1 <= n <= 100), the number of given strings, followed by n lines, each representing one string of minimum length 1 and maximum length 100. There is no extra white space before and after a string.

Output
There should be one line per test case containing the length of the largest string found.

Sample Input
2
3
ABCD
BCDFF
BRCD
2
rose
orchid

Sample Output
2
2

题解：
这一题听说暴搜即可，对于每次输入的字符串中找到最短的那个字符串，枚举那个字符串的所有连续子串，生成子串以及他的反串，再在其他字符串中找即可，此处查找时使用strstr函数是比较方便的，用法可以参见http://blog.youkuaiyun.com/tommy_wxie/article/details/7554224