POJ2503: Babelfish (Binary)

POJ2503: Babelfish (Binary)

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 shocould be translated as "eh ".

Sample Input

dog ogdaycat atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay

Sample Output

catehloops

In my opinion, it is a dictionary tree. However, if I see this question when I search for a binary topic, this question will certainly be solved in binary mode.

I think it's a good idea to use sscanf functions.

#include 
  
   #include 
   
    #include using namespace std;struct node{    char s1[20],s2[20];} a[100005];int len;int cmp(node a,node b){    return strcmp(a.s2,b.s2)<0;}int main(){    len = 0;    int i,j;    char str[50];    while(gets(str))    {        if(str[0] == '\0')        break;        sscanf(str,"%s%s",a[len].s1,a[len].s2);        len++;    }    sort(a,a+len,cmp);    while(gets(str))    {        int l = 0,r= len-1,mid,flag = 1;        while(l<=r)        {            int mid = (l+r)>>1;            if(strcmp(str,a[mid].s2)==0)            {                printf("%s\n",a[mid].s1);                flag = 0;                break;            }            else if(strcmp(str,a[mid].s2)<0)                r = mid-1;            else                l = mid+1;        }        if(flag)            printf("eh\n");    }    return 0;}