uva10391 - Compound Words
2013-03-22 21:32
323 查看
IY题目
哈希查找。
思路也很简单。
首先把所有数据读入,用哈希数组记录出现的单词
然后对每个单词进行判断,详细点说,把每个单词分成两部分,然后进入哈希数组,判断两部分是否都是已经存在的单词。
代码也不长。
#include <cstdio>
#include <cstring>
#define M 120013
int head[M], next[M];
char st[M][30];
int is_equal(int cur, int a, int b, int u)
{
if(b-a!=(int)strlen(st[u])) return 0;
for(int i = 0; i < b-a; i++)
if(st[u][i]!=st[cur][i+a]) return 0;
return 1;
}
int hash(char *A, int a, int b)
{
int s = 0;
for(int i = a; i < b; i++)
s = (s * 26 + A[i] - 'a')%M;
return s;
}
void try_to_insert(int cur)
{
int h = hash(st[cur],0,strlen(st[cur]));
next[cur] = head[h];
head[h] = cur;
}
int is_find(int cur,int a, int b)
{
int h = hash(st[cur],a, b), u = head[h];
while(u)
{
if(is_equal(cur,a,b,u)) return 1;
u = next[u];
}
return 0;
}
void solve(int cur)
{
int len = strlen(st[cur]);
for(int i = 1; i <len-1; i++)
if(is_find(cur,0,i)&&is_find(cur,i,len))
{ printf("%s\n",st[cur]); return; }
}
int main ()
{
int c = 1;
while(scanf("%s",st[c])!=EOF) {try_to_insert(c); getchar(); c++; }
for(int i = 1; i < c; i++) solve(i);
return 0;
}
哈希查找。
思路也很简单。
首先把所有数据读入,用哈希数组记录出现的单词
然后对每个单词进行判断,详细点说,把每个单词分成两部分,然后进入哈希数组,判断两部分是否都是已经存在的单词。
代码也不长。
#include <cstdio>
#include <cstring>
#define M 120013
int head[M], next[M];
char st[M][30];
int is_equal(int cur, int a, int b, int u)
{
if(b-a!=(int)strlen(st[u])) return 0;
for(int i = 0; i < b-a; i++)
if(st[u][i]!=st[cur][i+a]) return 0;
return 1;
}
int hash(char *A, int a, int b)
{
int s = 0;
for(int i = a; i < b; i++)
s = (s * 26 + A[i] - 'a')%M;
return s;
}
void try_to_insert(int cur)
{
int h = hash(st[cur],0,strlen(st[cur]));
next[cur] = head[h];
head[h] = cur;
}
int is_find(int cur,int a, int b)
{
int h = hash(st[cur],a, b), u = head[h];
while(u)
{
if(is_equal(cur,a,b,u)) return 1;
u = next[u];
}
return 0;
}
void solve(int cur)
{
int len = strlen(st[cur]);
for(int i = 1; i <len-1; i++)
if(is_find(cur,0,i)&&is_find(cur,i,len))
{ printf("%s\n",st[cur]); return; }
}
int main ()
{
int c = 1;
while(scanf("%s",st[c])!=EOF) {try_to_insert(c); getchar(); c++; }
for(int i = 1; i < c; i++) solve(i);
return 0;
}
相关文章推荐
- UVA10391 Compound Words
- uva 10391 compound words
- UVa 10391 - Compound Words
- uva10391 Compound Words
- uva 10391 Compound Words(查找)
- Uva 10391 - Compound Words
- 字符串hash uva 10391 - Compound Words
- UVA 10391 - Compound Words
- UVA10391 ZOJ1825 Compound Words【SET+暴力】
- Uva - 10391 Compound Words(hash or stl)
- UVA 10391(p135)----Compound Words
- UVA 10391 Compound Words 用set实现
- UVa 10391 Compound Words(字符串+查找)
- UVA 10391 Compound Words(hash字符串)
- UVa-10391 Compound Words
- UVa 10391 - Compound Words (字符串hash)
- Uva-10391-Compound Words
- uva 10391 Compound Words
- uva 10391 - Compound Words
- uva 10391 Compound Words (字符串-hash)