hdu 5510 Bazinga（暴力）

Ladies and gentlemen, please sit up straight.
Don't tilt your head. I'm serious.

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<queue>
#include<set>
#include<bitset>
#include<map>
#include<vector>
#include<stdlib.h>
#include <stack>
using namespace std;
#define PI acos(-1.0)
#define max(a,b) (a) > (b) ? (a) : (b)
#define min(a,b) (a) < (b) ? (a) : (b)
#define ll long long
#define eps 1e-10
#define MOD 1000000007
#define N 506
#define M 2006
#define inf 1e12
int n;
char s
[M];
int vis
;
int main()
{
int t;
int ac=0;
scanf("%d",&t);
while(t--){
memset(vis,0,sizeof(vis));
scanf("%d",&n);
int ans=-1;
for(int i=1;i<=n;i++){
scanf("%s",s[i]);
for(int j=i-1;j>=1;j--){
if(vis[j]) continue;
if(strstr(s[i],s[j])==0) ans=i;
else vis[j]=1;
}
}

printf("Case #%d: ",++ac);

if(ans==-1){
printf("-1\n");
}else{
printf("%d\n",ans);
}
}
return 0;
}