UVA 10815-andy ' s first Dictionary (string emulation + sort + Repeat Delete)

Andy ' s first DictionaryTime limit:MS Memory Limit:0KB 64bit IO Format:%lld & %llu SubmitStatus

Description

Problem B:andy ' s first Dictionary
Time Limit:3 seconds

andy, 8, have a dream-he wants to produce his very own dictionary. This is a easy task for him, as the number of words that he knows are, well, not quite enough. Instead of thinking up all the words himself, he had a briliant idea. From him bookshelf he would pick one of his favourite stories 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 the is where a computer program is helpful.

You is asked to write a program this lists all the different words in the input text. In this problem, a word was defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with is also to be considered. Furthermore, your program must is case insensitive. For example, words like "apple", "apple" or "apple" must is considered the same.

Input

The input file is a text with no more than lines. A input line have at most 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 is in lower case and sorted in alphabetical order. You can is sure that he number of distinct 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

Aadventuresblondescamedisneylandforkgoinghomeinleftreadroadsignsothetheytotwowentwerewhen

Test instructions: Sorts the entered words in dictionary order, removing duplicates.

Note that the array size is 5000*200.

#include <stdio.h> #include <string.h> #include <stdlib.h> #include <algorithm> #include <    Iostream> #include <string>using namespace Std;char str[10010];string a[1000010];int main () {int i;    int flag;    int cnt=-1; while (gets (str)) {flag=0;//is used to mark whether the current input is alphabetic or otherwise; for (i=0; str[i]!= '; i++) {if (str[i]&gt                    = ' a ' &&str[i]<= ' Z ') {if (!flag) {cnt++;                    A[cnt]=str[i];                    flag=1;                } else {a[cnt]=a[cnt]+str[i];                    }} else if (str[i]>= ' A ' &&str[i]<= ' Z ') if (!flag) {                    cnt++;                    str[i]=str[i]+32;                    A[cnt]=str[i];                flag=1;  } else {str[i]=str[i]+32;                  A[cnt]=a[cnt]+str[i];        } else flag=0;    }} sort (a,a+cnt+1);    cout<<a[0]<<endl;        for (I=1; i<=cnt; i++) {if (a[i]!=a[i-1]) {cout<<a[i]<<endl; }} return 0;}

UVA 10815-andy ' s first Dictionary (string emulation + sort + Repeat Delete)