铜牌汇总1

Problem Description

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

For  n given strings S1,S2,⋯,Sn, labelled from 1 to n, you should find the largest i (1≤i≤n) such that there exists an integer j (1≤j<i) and Sj is not a substring of Si.

A substring of a string Si is another string that occurs in Si. For example, ``ruiz" is a substring of ``ruizhang", and ``rzhang" is not a substring of ``ruizhang".

 

Input

The first line contains an integer  t (1≤t≤50) which is the number of test cases.
For each test case, the first line is the positive integer n (1≤n≤500) and in the following n lines list are the strings S1,S2,⋯,Sn.
All strings are given in lower-case letters and strings are no longer than 2000 letters.

 

Output

For each test case, output the largest label you get. If it does not exist, output  −1.

 

Sample Input

4

5

ab

abc

zabc

abcd

zabcd

4

you

lovinyou

aboutlovinyou

allaboutlovinyou

5

de

def

abcd

abcde

abcdef

3

a

ba

ccc

 

Sample Output

Case #1: 4

Case #2: -1

Case #3: 4

Case #4: 3

#include<stdio.h> 
#include<string.h>
struct node {
	char s[2005];
};

int main()
{
	int t;node a[505];
	scanf("%d",&t);
	for(int x=1;x<=t;x++)
	{
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%s",a[i].s);
		}
		int l=1,r=2,ans=-1;
		while(r<=n)
		{
			while(l<r)
			{
				if(strstr(a[r].s,a[l].s)) l++;
				else {ans=r;break;
				}
			}
			r++;
		}
		printf("Case #%d: %d\n",x,ans);
	}
	return 0;
 }