UVA 10815 - Andy's First Dictionary（字符串）

Andy's First Dictionary
Time limit: 3 seconds

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

---

Joke and image taken from the Web

=================================

给出几个句子，把句子中出现的所有单词按字母表排序，可能有重复出现的单词只记一遍

开始用sort排序怎么也排不了，于是各种查题解学会用qsort了orz

依然是按字符处理赋给二维数组s，遇到不是字母的就变成 "\0" 然后与已经存好的s比较，有相同的就a--不存这个单词，全部输入完成之后用qsort排序输出

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

using namespace std;

char s[5111][111];

int cmp(const void *a,const void *b)
{
    return strcmp((char*)a,(char*)b);
}

int main()
{
    int a=0,j=0;char c;
    memset(s,0,sizeof(s));
    while((c=getchar())!=EOF)
    {
        if(c>='A'&&c<='Z')
        {
            s[a][j++]=(c+'a'-'A');
        }
        else if(c>='a'&&c<='z')
        {
            s[a][j++]=c;
        }
        else if(j)//这里没写if(j)WA了，大概是最后会多一个空字符？
        {
            s[a][j]='\0';
            j=0;
            a++;
            for(int i=0;i<a-1;i++)
            {
                if(strcmp(s[i],s[a-1])==0)
                {
                    a--;
                    break;
                }
            }
        }
    }
    qsort(s,a,sizeof(s[0]),cmp);
    for(int i=0;i<a;i++)
        cout<<s[i]<<endl;
    return 0;
}