poj 3852（水题）

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
    int i,n,len[105],minLen;
    char a[105][105];
    while(scanf("%d",&n)==1&&n){
        minLen = 105;
        for(i=0;i<n;i++){
            scanf("%s",a[i]);
            len[i] = strlen(a[i]);
            minLen = min(minLen,len[i]);
        }
        for(i=1;i<minLen;i++){
            for(int j=0;j<n;j++){
                for(int k=j+1;k<n;k++){
                    if(!strcmp(a[j]+i,a[k]+i))
                        goto l1;
                }
            }
        }
l1:        printf("%d\n",i-1);
    }
    return 0;
}