UVA 409

/*这道题一直RE,果然数组开小了，key word最长可以有70个字符，坑爹啊，没看清题*/
/*思路就是开了一个二维数组 然后3循环暴力搜索，简单的字符串匹配，没什么技巧，而且题上说每个keyword前后都有非字母，所以判断的时候也很好判断*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
    int num[75];
    char temp[75];
    char key[30][75];
    char excuse[30][75];
    int i, j, k, N, K, t, max, cout;
    cout = 0;
    while( scanf( "%d%d", &N, &K ) != EOF )
    {
        getchar();
        memset( num, 0, sizeof(num) );
        for( i = 0; i < N; i++ )
            gets( key[i] );
        for( i = 0; i < K; i++ )
            gets( excuse[i] );
        t = 0;
	for( i = 0; i < N; i++ )
    		for( j = 0; j < K; j++ )
        		for( k = 0; k < strlen(excuse[j]); k++ )
			{
			    if( isalpha(excuse[j][k]) )
			        temp[t++] = tolower(excuse[j][k]);
			    else
			    {
			        temp[t] = '\0';
			        if( !strcmp(temp, key[i]) )
			        	   num[j]++;
			        t = 0;
			    }   
			}
        max = 1;
        for( i = 0; i < K; i++ )
           if( num[i] >= max )
                max = num[i];
        printf( "Excuse Set #%d\n", ++cout );
        for( i = 0; i < K; i++ )    
            if( num[i] == max )
                printf( "%s\n", excuse[i] );
        printf( "\n" );
    }
    return 0;
}