最短的名字

1
3
aaaaa
bbb
abababab 

5 

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;

const int maxn=1000+5;
string a[maxn];

int dfs(int first,int last,int d)
{
	if(first+1==last) return 0;
	int l=first,temp=a[first][d],res=last-first;
	for(int i=first;i<last;i++)
	{
		if(temp!=a[i][d])
		{
			res+=dfs(l,i,d+1);
			l=i;
			temp=a[i][d];
		}
		if(i==last-1&&temp==a[i][d]) res+=dfs(l,i+1,d+1);
	}
	return res;
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int i,n;
		scanf("%d",&n);
		for(i=0;i<n;i++) cin>>a[i];
		if(n==1) {printf("1\n"); continue;}
		sort(a,a+n);
		printf("%d\n",dfs(0,n,0));
	}
	return 0;
}