ACM-Blue Jeans

package demo3;


import java.util.Scanner;


public class BlueJeans {
int next[]=new int[100];
String[] input=new String[10];
public BlueJeans() {
Scanner  scanner=new Scanner(System.in);
int t,n,m,count;
String string="";
char[][] str=new char[10][60];
t=scanner.nextInt();
while(t--!=0){
m=0;
count=n=scanner.nextInt();
while (n--!=0) {

input[m++]=scanner.next();
str[m-1]=input[m-1].toCharArray();
}
String finalValue="";
for (int j = 3; j < 60; j++) {
for (int i = 0; i < str[0].length-j; i++) {
String str1=input[0].substring(i, i+j);
int sum=1,number=count;
while (number!=1) {
if (force(str1, input[--number])==0) {
sum=0;
}
}
if (sum==0) {
if (j==3) {
System.out.println("no significant commonalities");
i=60;
j=60;
}else if(i==59-j){
System.out.println(finalValue);
i=60;
j=60;
}
}else {
finalValue=str1;
j++;
i=-1;
}


}
}


}
}


  static int  force(String sht,String lon){
for (int i = 0; i < lon.length()-sht.length(); i++) {
if (lon.substring(i, i+sht.length()).equals(sht)) {
return 1;
}
}
 return 0;
  }
public static void main(String[] args) {
new BlueJeans();
}
}