POJ2503 - Babelfish - 字符串处理+map/哈希

最新推荐文章于 2022-04-09 22:28:03 发布

寒江雪里独钓着的蓑笠翁

最新推荐文章于 2022-04-09 22:28:03 发布

阅读量480

点赞数

分类专栏：哈希字符串文章标签： acm poj

本文链接：https://blog.csdn.net/dragon60066/article/details/72188530

版权

字符串同时被 2 个专栏收录

25 篇文章 0 订阅

订阅专栏

哈希

6 篇文章 0 订阅

订阅专栏

本博客介绍了一个简单的字典翻译程序的设计与实现。该程序能够处理大量词汇的输入，并将外语单词转换成对应的英文单词。若词汇不在字典中，则统一以eh代替。文章详细解释了输入输出格式及样例，并提供了使用C++实现的AC代码。

摘要由CSDN通过智能技术生成

1.题目描述：

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

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

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

Sample Output

cat
eh
loops

Hint

Huge input and output,scanf and printf are recommended.

2.题意概述：

输入一个字典，字典格式为“英语à外语”的一一映射关系

然后输入若干个外语单词，输出他们的英语翻译单词，如果字典中不存在这个单词，则输出“eh”

3.解题思路：

既可以手写哈希，也可以用STL的map，这题一个坑点是处理字符串

4.AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#define INF 0x7fffffff
#define maxn 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7;
using namespace std;
typedef long long ll;
map<string, string> mp;
int main()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  long _begin_time = clock();
#endif
  char line[maxn];
  char *a, *b;
  string ans;
  while (gets(line) && strlen(line))
  {
    a = strtok(line, " ");
    b = strtok(NULL, " ");
    mp[string(b)] = string(a);
  }
  while (cin >> ans)
  {
    if (!mp.count(ans))
    {
      puts("eh");
      continue;
    }
    cout << mp[ans] << endl;
  }
#ifndef ONLINE_JUDGE
  long _end_time = clock();
  printf("time = %ld ms\n", _end_time - _begin_time);
#endif
  return 0;
}