#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
struct STR
{
int len,num;
char s[1005];
STR():len(0){};
}str[25],M;
int maxn,T = 1;
int main()
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif // LOCAL
int K,E;
while(~scanf("%d%d",&K,&E))
{
getchar();
char s[K][25];
for(int i = 0; i < K; i++)
gets(s[i]);
for(int i = 0; i < E; i++)
{
gets(str[i].s);
str[i].len = strlen(str[i].s);
str[i].num = 0;
for(int j = 0; j < str[i].len; j++)
{
if(!isalpha(str[i].s[j]))continue;//不是字母就继续循环
//循环到不是字母
while(isalpha(str[i].s[j]))M.s[M.len++] = tolower(str[i].s[j++]);//可能是大写字母转换成小写
M.s[M.len] = '\0';
for(int k = 0; k < K; k++)
{
if(strcmp(M.s,s[k])==0){str[i].num++;break;}//累加关键字数目
}
M.len = 0;
}
maxn = max(maxn,str[i].num);//最多的关键字数
}
printf("Excuse Set #%d\n",T++);
for(int i = 0; i < E; i++)
if(maxn == str[i].num)puts(str[i].s);
printf("\n");
maxn = 0;//记着清零
}
return 0;
}
uva 409 - Excuses, Excuses!
最新推荐文章于 2021-07-28 16:57:40 发布