集合：set （UVA10815）

Andy’s First Dictionary
Problem Description
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

题意分析：
找出文本中的所有不同单词，按字典序从小到大输出。

一个set的简单应用，直接分析代码

#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);		//用来分割空格挨个insert 
		while(ss >> buf)
			dict.insert(buf); 
	}
	//迭代器 
	for( set <string> :: iterator it = dict.begin(); it != dict.end(); ++it)
		cout << *it << "\n";
	
	return 0;
}