试题 算法提高 Substrings
问题描述
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.
输入格式
The first line of the input contains a single integer t (1 <= t <= 10), t
