解题报告

思路：

字典树应用，dfs回溯遍历字典树

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
struct node {
    int v;
    node *next[26];
};
int l,m,cnt;
char str[100],ch[100],dic[5500][100];
node *newnode()
{
    int i,j;
    node *p=new node;
    p->v=0;
    for(i=0; i<26; i++)
        p->next[i]==NULL;
    return p;
}
void addnode(node *root,char *str)
{
    node *p=root;
    int i,l=strlen(str);
    for(i=0; i<l; i++) {
        int t=str[i]-'a';
        if(p->next[t]==NULL)
            p->next[t]=newnode();
        p=p->next[t];
    }
    p->v=1;
}
void dfs(node *p)
{
    if(p->v) {
        ch[l]=0;
        strcpy(dic[cnt++],ch);
    }
    for(int i=0; i<26; i++) {
        if(p->next[i]) {
            ch[l++]=i+'a';
            dfs(p->next[i]);
            l--;
        }
    }
}
int main()
{
    char c;
    m=0;
    l=0;
    cnt=0;
    node *root=newnode();
    while((c=getchar())!=EOF) {
        if((c>='a'&&c<='z')||(c>='A'&&c<='Z')) {
            if(c>='a'&&c<='z')
                str[m++]=c;
            else str[m++]=c+32;
        } else {
            str[m]=0;
            m=0;
            addnode(root,str);
        }
    }
    dfs(root);
    for(int i=0; i<cnt; i++) {
        if(dic[i][0]!='\0')
            printf("%s\n",dic[i]);
    }
    return 0;
}

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