UVA 10815 (暑假-字符串(2) -D - Andy's First Dictionary)

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

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

int main() {
	char str[210], word[150010][50] = {0};
	int n;
	int count = 0;
	while (gets(str)) {
		//转成小写字母
		for (int j = 0; j < strlen(str); j++)
			if (str[j] >= 'A' && str[j] <= 'Z')
				str[j] += 32;

	//分离出单词
		for (int j = 0; j < strlen(str); j++) {
			if (str[j] >= 'a' && str[j] <= 'z') {
				for (int k = 0; str[j] >= 'a' && str[j] <= 'z'; k++) {
					word[count][k] = str[j++];
				}
				count++;
			}
		}
	}
	//排序
	qsort(word, count, sizeof(word[0]), cmp_string);

	for (int i = 0; i < count; i++)
		if (strcmp(word[i], word[i+1]) || i == count - 1)
			printf("%s\n", word[i]);
	return 0;
}