UVA Babelfish（STL map）

Problem C: Babelfish

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 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 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

Output for Sample Input

cat eh loops

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<map>

using namespace std;

char a[100001][11],b[100001][11];

int main()
{

    map<string,int>p;
    map<string,int>::iterator it;
    int n = 1;
    char aa[30];
    while(gets(aa)!=NULL)
    {
        if(strlen(aa) == 0)
        {
            break;
        }
        sscanf(aa,"%s%s",a[n],b[n]);
        n++;
    }
    for(int i=1;i<n;i++)
    {
        p[b[i]] = i;
    }
    char str[200];
    while(scanf("%s",str)!=EOF)
    {
        if(p[str] == 0)
        {
            printf("eh\n");
        }
        else
        {
            printf("%s\n",a[p[str]]);
        }
    }
    return 0;
}