<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
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.
</blockquote>

<h2 id="input">Input</h2>
<blockquote>
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.
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as &quot;eh&quot;.
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
dog ogday 
cat atcay 
pig igpay 
froot ootfray 
loops oopslay
atcay 
ittenkay 
oopslay
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
cat 
eh 
loops
</blockquote>
<h2 id="hint">Hint</h2>
<blockquote>
Huge input and output,scanf and printf are recommended.
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
这道题的意思就是进行单词翻译
关键点在于：
<ul>
<li>读入数据</li>
<li>映射</li>
</ul>
由于数据存在一行两个单词和一行一个单词两种形式，因此，我们再读入时需要区分开。
另一方面，由于需要对单词进行映射，因此我们可以采用<code>map</code>，进行<code>string</code>对<code>string</code>的映射
最后输出时使用<code>cout</code>来输出（<code>string</code>格式）
如果需要进一步优化时间可以采用trie树
<h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
HomePage:http://www.oyohyee.com
Email:oyohyee@oyohyee.com
Blog:http://www.cnblogs.com/ohyee/

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/

#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
using namespace std;

//DEBUG MODE
#define debug 0

//循环
#define REP(n) for(int o=0;o&lt;n;o++)

const int maxn = 100005;
const int maxm = 100;

inline int read_string(char s[]) {
 char c;
 int i = 0;
 //while(!(((c = getchar()) ==&#39; &#39;) || (c &gt;= &#39;a&#39;&amp;&amp;c &lt;= &#39;z&#39;)))
 // if(c == EOF)
 // return 0;
 if((c = getchar())== EOF)
 return 0;
 while((c == &#39; &#39;) || (c &gt;= &#39;a&#39;&amp;&amp;c &lt;= &#39;z&#39;)) {
 s[i++] = c;
 c = getchar();
 }
 s[i] = &#39;\0&#39;;
 return i;
}

bool Do() {
 char temp[maxm*2];
 map&lt;string,string&gt; dict;
 map&lt;string,string&gt;::iterator it;
 char a[maxm],b[maxm];

 while(read_string(temp)) {
 if(strcmp(temp,&#34;&#34;) == 0)
 break;
 sscanf(temp,&#34;%s %s&#34;,a,b);
 dict[b] = a;
 }

 while(scanf(&#34;\n%s&#34;,a) != EOF) {
 cout &lt;&lt; (dict.count(a) ? dict[a] : &#34;eh&#34; )&lt;&lt; &#34;\n&#34;;
 }
 

 return false;
}

int main() {
 while(Do());
 return 0;
}
</pre>

POJ 2503.Babelfish