zoj 1109 我又学了一招

/*
 Language of FatMouse

--------------------------------------------------------------------------------

Time Limit: 10 Seconds      Memory Limit: 32768 KB

--------------------------------------------------------------------------------

We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.

Input Specification

Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output Specification

Output is the message translated to English, one word per line. FatMouse 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>//2217008 2010-06-28 15:32:51 Accepted  1109 C++ 2300 11008 悔惜晟
#include<cstdio>
#include<string>
#include<map>
using namespace std;

map<string, string> df;
string s1, s2, s3;

int main()
{
 
 char str[40];
 int i, j, len;
 while(gets(str) && str[0] != '/0')//这里处理，有点让人纠结的
 {
  s1 = "";
  s2 = "";
  len = strlen(str);
  for(i = 0; i < len ; i++)
  {
   if(str[i] == ' ')
    break;
   else
    s1 += str[i];
  }
  for(j = i + 1; j < len; j++)
  {
   s2 += str[j];
  }
  df[s2] = s1;
 }
 while(cin>>s3)
 {
  if(df.find(s3) != df.end()) // 这是找不到的情况的判断
   cout<<df[s3]<<endl;
  else
   cout<<"eh"<<endl;
 }

 

}