#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;
const int Max=120010;
char word[Max][100];
int search(char *str,int n)
{
int left=0,right=n-1;
while(left<=right)
{
int mid=(left+right)>>1;
if(!strcmp(str,word[mid]))
return 1;
if(strcmp(str,word[mid])<0)
right=mid-1;
else
left=mid+1;
}
return 0;
}
int main()
{
int n=0;
while(scanf("%s",word[n++])!=EOF);
for(int i=0; i<n; i++)
{
int len=strlen(word[i]);
char str[100],*str1;
for(int j=0,k=0; j<len-1; j++)
{
str[k++]=word[i][j];
str[k]='\0';
str1=word[i]+j+1;
if(search(str,n)&&search(str1,n))
{
printf("%s\n",word[i]);
break;
}
}
}
return 0;
}
uva10391 单词复合 利用二分查找求解
最新推荐文章于 2021-04-12 15:14:47 发布