UVA - 10815 Andy's First Dictionary

axiqia

于 2015-04-04 14:53:45 发布

阅读量572

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/axiqia/article/details/44873095

版权

ACM 专栏收录该内容

27 篇文章 1 订阅

订阅专栏

Description

Problem B: Andy's First Dictionary
Time limit: 3 seconds

Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.

You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like "Apple", "apple" or "APPLE" must be considered the same.

Input

The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.

Output

Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.

Sample Input

Adventures in Disneyland

Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."

So they went home.

Sample Output

a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
when

Joke and image taken from the Web

Source

Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 6. String Processing :: Ad Hoc String Processing
Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: String
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Data Structures and Libraries :: Non Linear Data Structures with Built-in Libraries :: C++ STL map/set (Java TreeMap/TreeSet)
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Data Structures and Libraries :: Non Linear Data Structures with Built-in Libraries :: C++ STL set (Java TreeSet)
Root :: AOAPC II: Beginning Algorithm Contests (Second Edition) (Rujia Liu) :: Chapter 5. C++ and STL :: Examples

/*
    Coder: Shawn_Xue
    Date: 2015.4.4
    Result: AC
*/
#include <iostream>
#include <string>
#include <set>
#include <sstream>
using namespace std;

set<string> dict; //string集合

int main()
{
    string s, buf;
    while(cin >> s)
    {
        for(int i = 0; i < s.length(); i ++)
            if(isalpha(s[i]))
                s[i] = tolower(s[i]);
            else s[i] = ' ';    // 非字母如标点符号变为空格
        stringstream ss(s); //定义一个输入输出流，将s载入流中
        while(ss >> buf)//过滤空格
            dict.insert(buf);//加入到集合set中
    }
    for(set<string>::iterator it = dict.begin(); it != dict.end(); ++it)  //迭代
        cout << *it << endl;
    return 0;
}