uva Andy's First Dictionary

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

char ss[100000][300];

struct Chr
{
    char nam[300];
}chr[100000];

bool cmp(Chr a,Chr b)
{
    return strcmp(a.nam,b.nam)<0;
}

int main()
{
    int i,len;
    int k1,k2;
    int cas=0;
    k1=k2=0;
    while(gets(ss[cas])!=NULL)
    {
        len=strlen(ss[cas]);
        
        for (i=0;i<=len;i++)
        {
            if(isupper(ss[cas][i]))  ss[cas][i]+=32;
            if(!isupper(ss[cas][i]) && !islower(ss[cas][i]))
            {
                if(isupper(chr[k1].nam[0]) || islower(chr[k1].nam[0]))
                {
                    chr[k1].nam[k2]='\0';
                    k1++;
                    k2=0;
                }
            }
            else chr[k1].nam[k2++]=ss[cas][i];
        }
        cas++;
    }
    sort(chr,chr+k1,cmp);
    for (i=0;i<k1;i++)
    {
        if(strcmp(chr[i].nam,chr[i+1].nam)!=0 && (isupper(chr[i].nam[0]) || islower(chr[i].nam[0]))) printf("%s\n",chr[i].nam);
    }
    //if(strcmp(chr[i].nam,chr[i-1].nam)!=0) printf("%s\n",chr[i].nam);
    return 0;
}