for(i = 0;i < M;i++){
gets(keywords[i]);
}
//输入借口
for(i = 0;i < N;i++){
gets(str[i]);
int len = strlen(str[i]);
for(j = 0;j < len;){
k = 0;
//提取单词
while((str[i][j] >= 'a' && str[i][j] <= 'z') || (str[i][j] >= 'A' && str[i][j] <= 'Z')){
//转换为小写
if(str[i][j] >= 'A' && str[i][j] <= 'Z'){
temp[k++] = str[i][j] - 'A' + 'a';
}
else{
temp[k++] = str[i][j];
}
j++;
}
j++;
temp[k] = '\0';
//和关键词进行匹配
count[i] ++;
}
}
//最大借口关键词个数
if(Max < count[i]){
Max = count[i];
}
}//for
//输出
printf("Excuse Set #%d\n",Case);
Case++;
//最差借口
for(i = 0;i < N;i++){
if(Max == count[i]){
puts(str[i]);
}
}
printf("\n");
}
return 0;
}