POJ 2503.Babelfish-sscanf()函数+strcmp()函数+二分

Babelfish

 

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 44545		Accepted: 18803

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

Hint

Huge input and output,scanf and printf are recommended.

 

 

题意就是输入一堆字符串，左边的对应着右边的，然后下面给出右边的，让你输出来左边的。

输入字符串的时候，碰到空行就不再输入了。就用strlen就可以。

处理字符串的时候，在这里卡住了，后来解决了，靠strcmp，sscanf。

二分二分！！！

 

代码:

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+;

struct node{
    char s1[],s2[];
}a[N];

int n;

int cmp(node a,node b){
    return strcmp(a.s2,b.s2)<;                    //感觉好厉害(；´д｀)ゞ
}

int main(){
    n=;
    char str[];
    while(gets(str)){
        if(str[]=='\0') break;
        sscanf(str,"%s%s",a[n].s1,a[n].s2);        //好厉害(；´д｀)ゞ
        n++;
    }
    sort(a,a+n,cmp);
    while(gets(str)){
       int l=,r=n,mid,flag=;
       while(l<=r){                                //二分
        mid=(l+r)>>;
        if(strcmp(str,a[mid].s2)==){
           printf("%s\n",a[mid].s1);
           flag=;break;
        }
        else if(strcmp(str,a[mid].s2)<)
            r=mid-;
        else
            l=mid+;
       }
       if(flag)
        printf("eh\n");
    }
    return ;
}