UVA - 10815 Andy's First Dictionary

简单题，主要教set的应用
输出多少个不重复的单词，但我个人不是很想用string，所以就用getchar()读入了。

#include <cstdio>
#include <set>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define maxn 10005
set<string> data;
char s[maxn];
int main()
{
    char c;
    int flag = 0;
    int num = 0;
    while(c = getchar())
    {
        if(c == EOF)break;
        if((c <= 'z' && c>='a') || (c>='A' && c<='Z')) s[num++] = c;
        if(!((c <= 'z' && c>='a') || (c>='A' && c<='Z')) && num != 0)
        {
            for(int i = 0; i < num; i++)
                if(isupper(s[i]))
                s[i] = s[i]-('A'-'a');
            s[num] = '\0';
            data.insert(s);
            num = 0;
        }
    }
    set<string>::iterator it = data.begin();
    for(; it != data.end(); it++)
        cout<<*it<<endl;
}