Uva-10815输入一个文本，找出所有不同的单词

最新推荐文章于 2022-09-21 19:03:22 发布

a_aron_

最新推荐文章于 2022-09-21 19:03:22 发布

阅读量319

点赞数 1

分类专栏： 21寒假补题

本文链接：https://blog.csdn.net/a_aron_/article/details/112910856

版权

该博客介绍了一个UVA在线判题中的问题，要求编写程序从输入文本中找出所有不同的单词，并忽略大小写，按字典序从大到小排序。输入限制为5000行，每行不超过200个字符。博客提到了解决方案使用set数据结构，结合stringstream和tolower函数来处理输入和转换为小写。示例输入和输出展示了程序预期的行为。

摘要由CSDN通过智能技术生成

Uva-10815
参考博客：zuiaimiusi
题目大意：

输入一个文本，找出所有不同的单词，按字典序从大到小输出，单词不区分大小写。

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