poj2503 Babelfish

 跟poj3349很类似的题目，这题还稍简单。用qsort快速排序和二分查找可以很轻松AC。以下是代码：

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
5135234	zen_chou	2503	Accepted	2356K	547MS	C	1212B	2009-05-11 20:12:26

 

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <string.h>
 4 #define MAXSIZE 100001
 5 typedef struct{
 6     char english[11];
 7     char foreign[11];
 8 }ENTRY;
 9 ENTRY entry[MAXSIZE];
 int cmp(const void *a, const void *b){
     return strcmp((*(ENTRY *)a).foreign, (*(ENTRY *)b).foreign);
 }
 
 int main()
 {
     int i, len_fre, count=0, low, high, mid, r, flag;
     char c, message[11];
     //freopen("input.txt", "r", stdin);
     while ((c=getchar())!='\n'){
         //读入数据
         i=0;
         len_fre=0;
         while (c!=' '){
             entry[count].english[i++]=c;
             c=getchar();
         }
         entry[count].english[i]='\0';
         c=getchar();
         i=0;
         while (c!='\n'){
             entry[count].foreign[i++]=c;
             c=getchar();
             len_fre++;
         }
         entry[count].foreign[i]='\0';
         count++;
     }
     //对entry按照foreign进行快速排序
     qsort(entry, count, sizeof(entry[0]), cmp);
     while (scanf("%s", message)!=EOF){
         //对entry的foreign进行二分查找
         low=0;
         high=count-1;
         flag=0;
         while (low<=high){
             mid=(low+high)/2;
             r=strcmp(message, entry[mid].foreign);
             if (r==0){
                 printf("%s\n", entry[mid].english);
                 flag=1;
                 break;
             }
             if (r<0){
                 high=mid-1;
             }
             else{
                 low=mid+1;
             }
         }
         if (flag==0){
             printf("eh\n");
         }
     }
 }