Andy, 8, has a dream - he wants to produce hisvery own dictionary. This is not an easy task forhim, as the number of words that he knows is,well, not quite enough. Instead of thinking up allthe words himself, he has a briliant idea. Fromhis bookshelf he would pick one of his favouritestory books, from which he would copy out allthe distinct words. By arranging the words inalphabetical order, he is done! Of course, it isa really time-consuming job, and this is where acomputer program is helpful.You are asked to write a program that listsall the different words in the input text. In thisproblem, a word is de ned as a consecutive se-quence of alphabets, in upper and/or lower case.Words with only one letter are also to be considered. Furthermore, your program must be CaSe In-SeNsItIvE. For example, words like \Apple", \apple" or \APPLE" must be considered the same.
Input
The input le is a text with no more than 5000 lines. An input line has at most 200 characters.
Inputis terminated by EOF.
Output
Your output should give a list of different words that appears in the input text, one in a line. Thewords should all be in lower case, sorted in alphabetical order. You can be sure that he number ofdistinct words in the text does not exceed 5000.Sample InputAdventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left."So they went home.
Sample
Output
a
adventures
blondes
came
disneyland
fork
going
homein
left
read
road
sign
so
the
they
to
two
went
were
when
题意:给你一段话,按字典序顺序输出
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<string>
#include<set>
#include<sstream>
using namespace std;
int main()
{
set<string>k;
string s,temp;
while(cin>>s)
{
if(s=="\n")
break;
int len = s.length();
for(int i = 0; i < len; i ++)
{
if(isalpha(s[i]))
s[i]=tolower(s[i]);
else
s[i]=' ';
}
stringstream ss(s);//将数组s导入流 ss中
while(ss>>temp)
k.insert(temp);
}
set<string>::iterator it;
for(it = k.begin(); it != k.end(); it ++)
cout<<*it<<endl;
}