国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

POJ 2503-Babelfish(STL-map)

2019-11-09 19:21:19
字體:
來源:轉載
供稿:網友

Babelfish
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 42442 Accepted: 18013

Description

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 ogdaycat atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay

Sample Output

catehloops

Hint

Huge input and output,scanf and printf are recommended.

Source

Waterloo local 2001.09.22

題目意思:

有一個簡易詞典,輸入的第一個串是英語,第二個串是外來詞。

然后輸入一些外來詞,根據詞典,將其翻譯成英語。

解題思路:

使用STL中的map就很簡單,其中外來詞是關鍵字。

注意詞典輸入完畢時以空行結尾,所以可以用gets一次讀一行,再根據空格分隔;

也可以用sscanf(str,"%s%s",str1,str2);

#include<iostream>#include<cstdio>#include<iomanip>#include<cmath>#include<cstdlib>#include<cstring>#include <map>#include<algorithm>using namespace std;map<string,string> m;int main(){    char str[15],str1[15],str2[15];//原串和分割后的兩個串    string s;    while(gets(str)&&str[0]!='/0')    {        memset(str1,'/0',sizeof(str1));        memset(str2,'/0',sizeof(str2));        int i,j,cnt=0;        for(i=0; i<strlen(str); ++i)        {            if(str[i]==' ') break;//根據空格分隔兩個字符串            else str1[i]=str[i];//第一個字符串        }        for(j=i+1; j<strlen(str); ++j)            str2[cnt++]=str[j];//第二個字符串        m[str2]=str1;//第二個字符串是關鍵字,存入map    }    while(cin>>s)    {        if(m[s].size()) cout<<m[s]<<endl;//如果存在則對應大小不為0        else cout<<"eh"<<endl;//不存在    }    return 0;}


發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 通城县| 汝州市| 察雅县| 布尔津县| 伊春市| 榕江县| 仪陇县| 海伦市| 大余县| 新蔡县| 苏州市| 太保市| 修武县| 隆昌县| 靖远县| 日照市| 浪卡子县| 扬中市| 石棉县| 江达县| 五寨县| 潢川县| 商洛市| 资源县| 沂水县| 龙岩市| 宁强县| 封开县| 闻喜县| 阳东县| 湖口县| 岫岩| 青田县| 游戏| 甘洛县| 乌拉特前旗| 蒲城县| 平遥县| 安义县| 长沙市| 阜阳市|