uva 10815 Andy's First Dictionary（字符串处理+sort排序）

Problem B: 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

题目大意：把所有单词按字典序排列，重复的输出一次。

解题思路：按字符读入，读入第一个字母时，开始新的一个单词；读入非首字母时，接在当前单词后面；读入非字母时；结束当前单词。然后用sort函数排序。（注意空行，单词上限其实字符串的最大数*每个字符串中单词的最大数）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

#define N 5005
#define M 201

struct say{
	char str[M];
};

say tem[N * M];

char strl(char ch)
{
	if (ch >= 'A' && ch <= 'Z')
		return ch + 32;
	else
		return ch;
}

int cmp(const say &a, const say &b)
{
	return strcmp(a.str, b.str) < 0;
}

int main()
{
	int cnt = 0;
	memset(tem, 0, sizeof(tem));
	char ch;
	int m = 0, bo = 0;
	while ((ch = getchar()) != EOF)
	{
		ch = strl(ch);
		if (ch >= 'a' && ch <= 'z' && bo)
			tem[cnt].str[m++] = ch;	
		else if (ch >= 'a' && ch <= 'z')
		{
			bo = 1;
			cnt++;
			m = 0;
			tem[cnt].str[m++] = ch;
		}
		else
		{
			bo = 0;
			tem[cnt].str[m] = '\0';
		}
	}

	sort(tem, tem + cnt + 1, cmp);

	for (int i = 1; i <= cnt; i++)
	{
		if(strcmp(tem[i].str, tem[i - 1].str) == 0)
			continue;
		puts(tem[i].str);
	}

	return 0;
}