uva 409 - Excuses, Excuses!

句子中的单词的查找

先将每个单词存起来，然后逐个比较；并且把每个单词的长度存起来，会节省时间

#include <stdio.h>
#include <string.h>
struct node
{
    char s[105];
    int num;
}a[25];
int main()
{
    int m, n, max, i, j, k, len, flag, x, p=1;
    char str[25][100], c[100];
    int b[25];
    while(scanf("%d%d",&m,&n) != EOF)
    {
        getchar();
        memset(b, 0, sizeof(b));
        max = 0;
        for(i = 0;i < m;i++)
        {
            gets(a[i].s);
            a[i].num = strlen(a[i].s);
        }
        for(i = 0;i < n;i++)
        {
            gets(str[i]);
        }
        for(i = 0;i < n;i++)
        {
            j = 0;
            while(str[i][j] != '\0')
            {
                if((str[i][j] >= 'A' && str[i][j] <= 'Z')||(str[i][j] >= 'a' && str[i][j] <= 'z'))
                {
                    len=0;
                    while((str[i][j] >= 'A' && str[i][j] <= 'Z')||(str[i][j] >= 'a' && str[i][j] <= 'z'))
                    {
                        c[len] = str[i][j];
                        len++;
                        j++;
                    }
                    for(k = 0;k < m;k++)
                    {
                        if(len == a[k].num)
                        {
                            flag=0;
                            for(x = 0; x < len; x++)
                            {
                                if(c[x] != a[k].s[x] && c[x] != a[k].s[x]+32&&c[x] != a[k].s[x]-32)
                                flag=1;
                            }
                            if(flag == 0)
                            b[i]++;
                        }
                    }
                }
                else
                {
                    j++;
                }
            }
            if(max < b[i])
            max = b[i];
        }
        printf("Excuse Set #%d\n",p);
        for(i = 0;i < n; i++)
        {
            if(b[i] == max)
            puts(str[i]);
        }
        puts("");
        p++;
    }
    return 0;
}