原文链接 http://acm.hdu.edu.cn/showproblem.php?pid=1894
String Compare
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2430 Accepted Submission(s): 597
Problem Description
Maybe there are 750,000 words in English and some words are prefix of other words, for example: the word "acm" can be treat as one prefix of "acmicpc". What's more, most of such pairs of words have relationship between them. Now give you a dictionary, your work is to tell me how many such pairs.
There may be other characters in the word, for example '_','-',and so on.
Pay attention that 'A' and 'a' are not the same character!
There may be other characters in the word, for example '_','-',and so on.
Pay attention that 'A' and 'a' are not the same character!
Input
In the first line of the input file there is an Integer T, which means the number of test cases. Followed by T test cases.
For each test case, in the first line there is an integer N(0<N<=50000), followed N lines, each contains a word whose length is less than 30 and no space appears in any word. There are no same words in two different lines.
For each test case, in the first line there is an integer N(0<N<=50000), followed N lines, each contains a word whose length is less than 30 and no space appears in any word. There are no same words in two different lines.
Output
For each test case, tell me how many such pairs. If the number is larger than 11519, just divide it by 11519 and only output the remainder.
Sample Input
2 2 acmicpc acm 3 a abc ab
Sample Output
1 3刚开始以为很难处理,后来想想,只要不是前缀的,就可以结束了,这样简单了,直接附上代码。# include<stdio.h> # include<string.h> # include<stdlib.h> #include<iostream> #include<algorithm> using namespace std; # define inf 11519 struct node{ char a[50]; }s[50005]; bool cmp(node a1,node b1) { return strcmp(a1.a,b1.a)<0; } int main() { int T,ans,n,i,j,k,len; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%s",s[i].a); sort(s,s+n,cmp); ans=0; for(i=0;i<n-1;i++) { len = strlen(s[i].a); for(j=i+1;j<n;j++) { for(k=0;k<len;k++) { if(s[i].a[k]==s[j].a[k]); else break; } if(k<len) break; else ans++; } } if(ans>inf) ans=ans%inf; printf("%d\n",ans); } return 0; }