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 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.

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

23ABCDBCDFFBRCD2roseorchid

22

Asia 2002, Tehran (Iran), Preliminary

//优化 #include 
    
     #include 
     
      #include 
      
       #include 
       
        using namespace std;const int N=100+10;int n,id,re,ilen;char c[N][N];int len[N];int main(){	int t,i,small,j,k,z,zz;	bool ok;	scanf("%d",&t);	while(t--){		re=0;		small=N;		scanf("%d",&n);		for(i=0;i
        
         0;i--){   //枚举子串长度		   for(j=0;re==0&&j+i-1
         
          =0;z--) { //从右开始 for(zz=0;zz
          
           #include 
           
            #include 
            
             #include 
             
              #include 
              
               using namespace std;const int N=100+10;int n,id,re,ilen,rlen;char c[N][N];int len[N];int main(){ int t,i,small,j,k,z,zz; bool ok; scanf("%d",&t); while(t--){ re=0; rlen=0; small=N; scanf("%d",&n); for(i=0;i
               
                0;j--) { //子串的长度 for(k=0;k
                
                 =0;z--){ //从右开始 for(zz=0;zz