CSU-ACM2017暑期训练1-Debug与STL C-Languages-map判重

题目：C-Languages

The Enterprise has encountered a planet that at one point had been inhabited. The only remnant from the prior civilization is a set of texts that was found. Using a small set of keywords found in various different languages, the Enterprise team is trying to determine what type of beings inhabited the planet.

Input

The first line of input will be N (1 ≤ N ≤ 100), the number of different known languages. The next N lines contain, in order, the name of the language, followed by one or more words in that language, separated with spaces. Following that will be a blank line. After that will be a series of lines, each in one language, for which you are to determine the appropriate language. Words consist of uninterrupted strings of upper or lowercase ASCII letters, apostrophes, or hyphens, as do the names of languages. No words will appear in more than one language. No line will be longer than 256 characters. There will be at most 1000 lines of sample text. Every sample text will contain at least one keyword from one of the languages. No sample text will contain keywords from multiple languages. The sample text may contain additional punctuation (commas, periods, exclamation points, semicolons, question marks, and parentheses) and spaces, all of which serve as delimiters separating keywords. Sample text may contain words that are not keywords for any specific language. Keywords should be matched in a case-insensitive manner.

Output

For each line of sample text that follows the blank line separating the defined languages, print a single line that identifies the language with which the sample text is associated.

Sample Input

4
Vulcan throks kilko-srashiv k'etwel
Romulan Tehca uckwazta Uhn Neemasta
Menk e'satta prah ra'sata
Russian sluchilos

Dif-tor heh, Spohkh. I'tah trai k'etwel
Uhn kan'aganna! Tehca zuhn ruga'noktan!

Sample Output

Vulcan
Romulan

  

           题目大意：先给你n串不同语言的字典，然后输入多组字符串，问你这串话是属于什么语言。

          思路：在字符串里面找在字典中出现过的单词，注意题目要求不区分大小写，并且有的标点符号要转化为空格。至于查找这里直接用的map来           映射，自己一开始脑抽写了个嵌套map的，下面给出两种代码，第二种简单些，也是普遍的思路。

            代码1：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
using namespace std;

void change(string &si)
{
    for(int j=0;j<si.size();j++)
    {
        if(si[j]==','||si[j]=='.'||si[j]=='!'||si[j]==';'||si[j]=='?'||si[j]=='('||si[j]==')')
            si[j]=' ';
    }
}

void lower(string &si)
{
    for(int j=0;j<si.size();j++)
    {
        if(si[j]>='A'&&si[j]<='Z')
            si[j]+=32;
    }
}

int n;
int flag,lan_num;
int cnt;
string s[111];
string language[111];
string a,b;
map<string,map<string,int>>m;

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        m.clear();
        getchar();
        for(int i=0;i<n;i++)
        {
            getline(cin,s[i]);
            stringstream ss(s[i]);
            ss>>a;
            language[i]=a;
            cnt=0;
            while(ss>>b)
            {
                lower(b);
                if(!m[a].count(b))
                    m[a][b]=++cnt;
            }
        }
        while(getline(cin,a))
        {
            change(a);
            stringstream ss(a);
            flag=0;
            while(!flag&&ss>>b)
            {
                lower(b);
                for(int i=0;i<n;i++)
                {
                    if(m[language[i]].count(b))
                    {
                        lan_num=i;
                        flag=1;
                        break;
                    }
                }
            }
            if(flag)
                cout<<language[lan_num]<<endl;
        }

    }
    return 0;
}

代码2：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
using namespace std;

void change(string k)
{
    for(int j=0;j<k.size();j++)
    {
        if(k[j]==','||k[j]=='.'||k[j]=='!'||k[j]==';'||k[j]=='?'||k[j]=='('||k[j]==')')
            k[j]=' ';
    }
}

void low(string k)
{
    for(int j=0;j<k.size();j++)
    {
        if(k[j]>='A'&&k[j]<='Z')
            k[j]+=32;
    }
}

int n;
int flag;
int cnt;
string s;
string a,b;
map<string,string>m;

int main()
{
    scanf("%d",&n);
    getchar();
    for(int i=0;i<n;i++)
    {
        getline(cin,s);
        stringstream ss(s);
        ss>>a;
        while(ss>>b)
        {
            low(b);
            m[b]=a;
        }
    }
    while(getline(cin,a))
    {
        change(a);
        stringstream ss(a);
        flag=0;
        while(!flag&&ss>>b)
        {
            low(b);
            if(m.count(b))
            {
                cout<<m[b]<<endl;
                break;
            }
        }
    }
    return 0;
}