Andy's First Dictionary UVA - 10815题解-优快云博客

该博客介绍了如何帮助8岁的Andy制作他的第一本字典，通过从故事书中提取不同的单词并按字母顺序排列。文章提供了输入输出格式的说明，以及一个关于如何处理大小写不敏感的单词的例子。解决方案是利用编程语言的set数据结构，自动按字典序排列提取的单词。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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 isa 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

思路

题目大意是给你一段文章，你需要提取其中的单词，并按字典序输出
使用set添加进去就自动按字典序排好的特性很容易解出此题

代码

#include"bits/stdc++.h"
using namespace std;

int main()
{
    string s, str;
    set<string>ch;
    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;
        ss<<s;
        while(ss >> str)ch.insert(str);
    }
    set<string>::iterator it; 
    for(it= ch.begin();it!=ch.end();it++){
        cout<<*it<<endl;
    }
}