1. 程式人生 > >安迪的第一個字典 Andy's First Dictionary, UVa 10815

安迪的第一個字典 Andy's First Dictionary, UVa 10815

列表 tsa uri dream lan copy tis appears books

(Time limit: 3 seconds)

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.

輸入文件是不超過5000行的文本。輸入行最多包含200個字符。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.

您的輸出應該給出輸入文本中出現的不同單詞的列表,一行在一行中。這些字都應該是小寫的,按字母順序排列。您可以確定他在文字中的不同單詞的數量不超過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

adventuresblondes

came

disneyland

fork

going

home

in

left

read

road

sign

so

the

they

to

two

went

were

when




安迪的第一個字典 Andy's First Dictionary, UVa 10815