pku2945 Find the Clones

http://poj.org/problem?id=2945

字符串，可以用字典树，我用qsort做的～

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

char s[20010][23];
int n, m;

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

int main()
{
    int i, sum[20010], count[20010];
    while(scanf("%d%d%*c", &n, &m), n||m)
    {
        for(i=0; i<n; i++)
        {
            scanf("%s", s[i]);
            s[i][m] = '\0';
        }
        qsort(s, n, sizeof(s[0]), cmp);
        memset(sum, 0, sizeof(sum));
        count[0] = 1;
        for(i=1; i<n; i++)
        {
            if(strcmp(s[i], s[i-1]) == 0)
            {
                count[i] = count[i-1]+1;
            }
            else
            {
                sum[count[i-1]] ++;
                //printf("%d %d\n", i-1, count[i-1]);
                count[i] = 1;
            }
        }
        sum[count[n-1]] ++;
        for(i=1; i<=n; i++)
        {
            printf("%d\n", sum[i]);
        }
    }
    return 0;
}