problemb:excuses,excuses!

llguanli llguanli     2022-08-30     310

关键词:

Description

Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to reduce the amount of time required listening to goofy excuses, Judge Ito has asked that you write a program that will search for a list of keywords in a list of excuses identifying lame excuses. Keywords can be matched in an excuse regardless of case.

Input

Input to your program will consist of multiple sets of data.

Line 1 of each set will contain exactly two integers. The first number ( tex2html_wrap_inline30 ) defines the number of keywords to be used in the search. The second number ( tex2html_wrap_inline32 ) defines the number of excuses in the set to be searched.
Lines 2 through K+1 each contain exactly one keyword.
Lines K+2 through K+1+E each contain exactly one excuse.
All keywords in the keyword list will contain only contiguous lower case alphabetic characters of length L ( tex2html_wrap_inline42 ) and will occupy columns 1 through L in the input line.
All excuses can contain any upper or lower case alphanumeric character, a space, or any of the following punctuation marks [SPMamp".,!?&] not including the square brackets and will not exceed 70 characters in length.
Excuses will contain at least 1 non-space character.

Output

For each input set, you are to print the worst excuse(s) from the list.

The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords.
If a keyword occurs more than once in an excuse, each occurrance is considered a separate incidence.
A keyword ``occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.
For each set of input, you are to print a single line with the number of the set immediately after the string ``Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in any order.

After each set of output, you should print a blank line.

Sample Input

5 3
dog
ate
homework
canary
died
My dog ate my homework.
Can you believe my dog died after eating my canary... AND MY HOMEWORK?
This excuse is so good that it contain 0 keywords.
6 5
superhighway
crazy
thermonuclear
bedroom
war
building
I am having a superhighway built in my bedroom.
I am actually crazy.
1234567890.....,,,,,0987654321??

???!!!!!! There was a thermonuclear war! I ate my dog, my canary, and my homework ... note outdated keywords?

Sample Output

Excuse Set #1
Can you believe my dog died after eating my canary... AND MY HOMEWORK?

Excuse Set #2 I am having a superhighway built in my bedroom. There was a thermonuclear war!

#include<stdio.h>
#include<string.h>
int main()
{
	int m,n,i,j,t,k,w=0;
	char a[100][100],b[100][100],c[100][100],x[100];
	int y;
	while(scanf("%d%d",&m,&n)!=EOF)
	{
		int num[100]={0};
		w++;
		getchar();
		for(i=0;i<m;i++)
		{
			gets(a[i]);	
			for(j=0;a[i][j];j++)
			{
				if(a[i][j]>=‘A‘&&a[i][j]<=‘Z‘)
					a[i][j]=a[i][j]+32;
			}	
		}
		for(i=0;i<n;i++)
		{
			gets(b[i]);	
			for(j=0;b[i][j];j++)
			{
				c[i][j]=b[i][j];
				if(c[i][j]>=‘A‘&&c[i][j]<=‘Z‘)
					c[i][j]=c[i][j]+32;
			}
			c[i][j]=‘‘;
			y=0;
            for(j=0;c[i][j];j++)
			{
				if(c[i][j]>=‘a‘&&c[i][j]<=‘z‘)
				{
					x[y++]=c[i][j];
				}
				else
				{
					x[y]=‘‘;
					for(k=0;k<m;k++)
					{
						if(strcmp(x,a[k])==0)
						{
							num[i]++;
							break;
						}
					}
			    	y=0;
				}
			}
	     //	for(i=0;i<n;i++)
		//	printf("%d
",num[i]);
		}
		int max=0;
		printf("Excuse Set #%d
",w);
		for(i=0;i<n;i++)
		{
			if(num[i]>=max)
				max=num[i];
		}
		for(i=0;i<n;i++)
		{
			if(max==num[i])
			{
				printf("%s
",b[i]);
			}
		}
		printf("
");
	}
	return 0;
}


poj1598zoj1315hdu1606uva409uvalive5493excuses,excuses!文本(代码片段)

Excuses,Excuses!TimeLimit:1000MSMemoryLimit:10000KTotalSubmissions:4701Accepted:1602DescriptionJudgeItoishavingaproblemwithpeoplesubpoenaedforjurydutygivingratherlameexcusesinordertoavoidserving.Inordertoreducetheamountoftimerequiredlisteningtogoofyexcuses,JudgeItohasaskedthatyouwriteaprogramthatwil... 查看详情

debitnote是啥意思

excuseme梗就是,你在逗我吗,满脸的无奈无语又有点鄙视对方还可以表愤怒,表不服,表疑问,表惊讶,表不懂,表无语等等,根据语境的不同可以延伸出无限含义。excuseme,学过英文的同学都知道这是"不好意思"的意思,除此之外,... 查看详情

excuse音标:ik'skjuz中的ik's里的k不用读吗?iks应该怎么读?另外:后面的se有的读s有的读z到底应该读哪

/iks/的/k/发喉轻音到可变成稍稍停顿后再发s,不用故意发出声注意cu/kju:/的/k/因为在/s/的后面要变音为/g/后面的se作动词读z,作名词读s,其实这两个发音听起来是很像的参考技术Ak要读啊作动词读z,作名词读s 查看详情

unit02会见直属上司

单词staff     员工supervisor  主管excuse    原谅charge    负责section    部门satisfied   满意的bottom&nbs 查看详情

三十动名词短语2

...e需求/需要postpone推迟delay推迟consider考虑deny否认advise建议excuse原谅practise练习escape避免mis 查看详情

015模块——起别名(代码片段)

...数据库选择1:mysql|2:oracle:‘)ifcmd==‘1‘:importmysqlasdb#mysql.excuse()e 查看详情

英语学习笔记---01---新概念第一册---lesson1excuseme!

  Lesson1  Excuseme! [词汇]excuse[iks5kju:z]                       v.原谅  查看详情

包含怎么写

...释1. [contain]∶里边含有。这个法案包含几条新条款。2. [excuse]∶同"包涵"。宽容,原谅。请您多包含点。[2]折叠引证详解1. 包容含有。汉桓宽《盐铁论•地广》:"王者包含并覆,普爱无私,不为近重施,不为远遗恩。&... 查看详情

removemove有啥区别表示百度知道里的都看过了所以别复制

...charge,unload,remove,strip搬迁move,remove,transfer免avoid,exempt,remove,excuse,absolve撤withdraw,remove,dismiss,evacuate,t 查看详情