Babelfish
Time Limit:3000MS |
|
Memory Limit:65536K |
Total Submissions:22593 |
|
Accepted:9698 |
Description
You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input
Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears
more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output
Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
Sample Input
dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay
atcay
ittenkay
oopslay
Sample Output
cat
eh
loops
#include<iostream>
using namespace std;
int i,j,num;
struct set
{
char fir[15],lat[15];
};
set dictionary[100010];
void cxbin()
{
char temp[30];
while(1)
{
gets(temp);
if(temp[0]=='\n' || temp[0]=='\0')
break;
int len=strlen(temp);
for(i=0;i<len;i++)
{
if(temp[i]==' ')
{
dictionary[num].fir[i]='\0';
break;
}
dictionary[num].fir[i]=temp[i];
}
for(i++,j=0;i<len;j++,i++)
dictionary[num].lat[j]=temp[i];
dictionary[num].lat[++j]='\0';
num++;
}
}
int cmp(const void *p1,const void *p2)
{
return strcmp((*(set *)p1).lat,(*(set *)p2).lat)>0?1:-1;
}
int search(char *a)
{
int max=num,min=0,mid;
while(max>=min)
{
mid=(max+min)/2;
if(strcmp(dictionary[mid].lat,a)>0)
{
max=mid-1;
}
else if(strcmp(dictionary[mid].lat,a)<0)
{
min=mid+1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
cxbin();
qsort(dictionary,num,sizeof(dictionary[0]),cmp);
char word[12];
while(scanf("%s",word)==1)
{
int sign=search(word);
if(sign==-1)
{
printf("eh\n");
}
else
printf("%s\n",dictionary[sign].fir);
}
return 0;
}
原来查找函数还可以用bsearch来查找。。。
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
using namespace std;
int i,j,num;
struct set
{
char fir[15],lat[15];
};
set dictionary[100010];
void cxbin()
{
char temp[30];
while(1)
{
gets(temp);
if(temp[0]=='\n' || temp[0]=='\0')
break;
int len=strlen(temp);
for(i=0;i<len;i++)
{
if(temp[i]==' ')
{
dictionary[num].fir[i]='\0';
break;
}
dictionary[num].fir[i]=temp[i];
}
for(i++,j=0;i<len;j++,i++)
dictionary[num].lat[j]=temp[i];
dictionary[num].lat[++j]='\0';
num++;
}
}
int cmp(const void *p1,const void *p2)
{
return strcmp((*(set *)p1).lat,(*(set *)p2).lat)>0?1:-1;
}
int cmp1(const void *p1,const void *p2)
{
return strcmp((char *)p1,(*(set *)p2).lat);
}
int main()
{
cxbin();
qsort(dictionary,num,sizeof(dictionary[0]),cmp);
char word[15];
while(scanf("%s",word)==1)
{
set *sign;
sign=(set *)bsearch(word,dictionary,num,sizeof(dictionary[0]),cmp1);
if(sign==NULL)
{
printf("eh\n");
}
else
printf("%s\n",sign->fir);
}
return 0;
}
分享到:
相关推荐
北大POJ2503-Babelfish 解题报告+AC代码
poj-1002源码,没有题解,题解看博客poj-1002源码,没有题解,题解看博客poj-1002源码,没有题解,题解看博客poj-1002源码,没有题解,题解看博客
POJ---1456.Supermarket测试数据及答案,题目描述:A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral ...
POJ-3299解题 C++源代码 Description Adapted from Wikipedia, the free encyclopedia The humidex is a measurement used by Canadian meteorologists to reflect the combined effect of heat and humidity. It...
西北工业大学-c语言-POJ-题目及答案-第七季.doc
poj-2528 Mayor's posters 测试数据及答案
poj 1000 - 2000 部分题目 官方分类 poj 1000 - 2000 部分题目 官方分类
算法-炮兵阵地(POJ-1185)(包含源程序).rar
算法-开关问题(POJ-1830)(包含源程序).rar
算法-青蛙的约会(POJ-1061)(包含源程序).rar
北大POJ2002-Squares 解题报告+AC代码
POJ - 2136. VerticalHistogram(统计字母个数)题目链接题目就是给你四行字符串,然后要你统计大写字母(只有大写字母)的个数,然后以特定
北大POJ3253-POJ3253-Fence Repair【STL优先队列】 解题报告+AC代码
POJ-2870 Light Up + DFS(1级DFS+1级DFS) + Python - 思维导图 链接:https://blog.csdn.net/xxdragon126/article/details/122095922?spm=1001.2014.3001.5501