POJ 2503 Babelfish qsort+bserach

Description

Input

Output

Sample Input

dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Sample Output

cat
eh
loops

Hint

Source

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
using namespace std;
struct Node{
    char word[20];
    char map[20];
}me[200000];
int cmp(const void *a,const void *b){
    return strcmp(((Node*)a)->map,((Node*)b)->map);
};
int bcmp(const void *a,const void *b){
    return strcmp(((char*)a),((Node*)b)->map);
};
int main(){
    char s[60];
    int n=0;
    Node *pos;
    while(gets(s)&&s[0]!='\0'){
        sscanf(s,"%s %s",me[n].word,me[n].map);
        n++;
    }
    qsort(me,n,sizeof(me[0]),cmp);
    while(gets(s)&&s[0]!='\0'){
        pos=(Node*)bsearch(s,me,n,sizeof(me[0]),bcmp);
        if(pos)printf("%s\n",pos->word);
        else printf("eh\n");
    }
    return 0;
}

POJ 2503 Babelfish qsort+bserach

原文：http://blog.csdn.net/zp___waj/article/details/47783985