Uva 10282 - Babelfish

Problem C: Babelfish

解题思路：这题简单题，放在这个章节里是因为lrj想让你用哈希过的，但是我却开始用STL里面的内容混过去的，用了map，学会了怎样将字符数组转换成字符串

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
map<string, string> dic;
int main(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    #endif
    char input[100];
    bool flag = false;
    while(fgets(input, 100, stdin) != NULL){
        int len = strlen(input);
        if(len == 1){
            flag = true;
            continue;
        }
        else if(input[len-1] == '\n') input[len-1] = '\0';
        if(flag == false){
            char left[12], right[12];
            sscanf(input, "%[^ ]", left);
            sscanf(input, "%*s%s", right);
            string _left(&left[0], &left[strlen(left)]);
            string _right(&right[0], &right[strlen(right)]);
            dic.insert(make_pair(_right, _left));
        }
        else{
            
            string _input(&input[0], &input[strlen(input)]);
            map<string, string>::const_iterator i = dic.find(_input);
            if(i != dic.end())
             cout<<i->second<<endl;
             else cout<<"eh"<<endl;
        }
    }
    return 0;
}