题目链接:
题目:
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 defined as a consecutive sequenceof 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. 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 Input
Adventures 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
home
in
left
read
road
sign
so
the
they
to
two
went
were
when
简单题
这题还可以用 stringstream (头文件:#include <sstream>)
我也是第一次用,看博客了解了一下。不了解的可以看看下面这个博客
AC代码:
#include <set>
#include <cstdio>
#include <string>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
set < string > sss;
int main()
{
string s,c;
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);
while(ss>>c)
sss.insert(c);
}
for (set<string>::iterator it = sss.begin(); it!=sss.end(); it++)
cout << *it << endl;
return 0;
}