zoukankan      html  css  js  c++  java
  • CSUOJ 1826 Languages map+stringstream

    Description

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

    Input

    The first line of input will be N (1 ≤ N ≤ 100), the number of different known languages. Thenext N lines contain, in order, the name of the language, followed by one or more words in thatlanguage, separated with spaces. Following that will be a blank line. After that will be a series oflines, 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, orhyphens, 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 sampletext will contain keywords from multiple languages. The sample text may contain additionalpunctuation (commas, periods, exclamation points, semicolons, question marks, and parentheses)and spaces, all of which serve as delimiters separating keywords. Sample text may contain wordsthat 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 asingle 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

    Hint

    题意:告诉你每种语言的一些单词,再给一个段话,判断是用什么语言写的。
    又一次感受到C++ stl的强大

    思路:使用 stringstream类读取字符串,通过>>操作分离出单词,然后进行判断 

    #include<stdio.h>
    #include<iostream>
    #include<algorithm>
    #include<sstream>
    #include<string>
    #include<string.h>
    #include<ctype.h>
    #include<map>
    using namespace std;
    map<string, string>m;
    void lower(string &s)
    {
    	for (int i = 0; i < s.length(); i++)
    	{
    		s[i] = tolower(s[i]);
    	}
    }
    int main()
    {
    	int T;
    	m.clear();
    	string a, b,name,s;
    	cin >> T;
    	getchar();
    	for (int i = 0; i < T; i++)
    	{
    		getline(cin, a);
    		stringstream ss(a);
    		ss >> name;
    		while (ss >> b)
    		{
    			lower(b);
    			m[b] = name;
    		}
    	}
    	while (getline(cin, s))
    	{
    		string tmp;
    		for (int i = 0; i < s.length(); i++)
    		{
    			if (s[i] == ',' || s[i] == '.' || s[i] == '!' || s[i] == ';' || s[i] == ' ? ' || s[i] == '(' || s[i] == ')')
    				s[i] = ' ';
    		}
    		stringstream ss1(s);
    		while (ss1 >> tmp)
    		{
    			lower(tmp);
    			if (m.count(tmp))
    			{
    				cout << m[tmp] << endl;
    				break;
    			}
    		}
    	}
    	return 0;
    }
    /**********************************************************************
    	Problem: 1826
    	User: leo6033
    	Language: C++
    	Result: AC
    	Time:68 ms
    	Memory:2348 kb
    **********************************************************************/
    

  • 相关阅读:
    HDU1443_Joseph_约瑟环
    HDU1568_求fibonacci的前四位
    HDU3368_翻转棋
    HDU1134_catalan_大数运算
    HDU1032_The 3n+1_数学题
    HDU2674_N!模2009
    HDU2067_小兔的棋盘_catalan_递推
    文件读写操作inputStream转为byte[] , 将InputStream写入本地文件
    JVM堆内存调优
    Java使用 POI 操作Excel
  • 原文地址:https://www.cnblogs.com/csu-lmw/p/9124428.html
Copyright © 2011-2022 走看看