TOJ 2028.Excuses, Excuses!(字符串)

原创 2016年08月30日 22:58:49

题目链接:http://acm.tju.edu.cn/toj/showp2028.html


2028.   Excuses, Excuses!
Time Limit: 0.5 Seconds   Memory Limit: 65536K
Total Runs: 288   Accepted Runs: 115



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 (1 ≤ K ≤ 20) defines the number of keywords to be used in the search. The second number (1 ≤ E ≤ 20) 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 (1 ≤ L ≤ 20) 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 [".,!?] 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 the input's 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!



Source: South Central USA 1996
Submit   List    Runs   Forum   Statistics

一道字符串匹配的题,就是输出与key数组匹配最多的串,注意串不知一个!

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <string> 

using namespace std;
struct Node{
	char str[201];
	int num;
}Word[31];
int main(){
	int n,t;
	char key[31][31];
	char str[201];
	int flag=1;
	while(~scanf("%d %d",&n,&t)){
		
		int Maxn=-1;
		for(int i=0;i<n;i++)
			scanf("%s",key[i]);
		getchar();
		//printf("%s\n",key[4]);
		for(int i=1;i<=t;i++){
			Word[i].num=0;
			gets(str);
			//printf("%s\n",str);
			int len=strlen(str);
			char tmp[201];
			strcpy(tmp,str);
			strcpy(Word[i].str,str);
			//printf("%s\n",tmp);
			for(int j=0;j<len;j++)
				if(tmp[j]>='A'&&tmp[j]<='Z')
					tmp[j]=tmp[j]-'A'+'a';
			string s(tmp);
			for(int j=0;j<n;j++){
				int sat=0;
				while(1){
					sat=s.find(key[j],sat);
					if(sat==-1)
						break;
					if(sat>=1)
						if((tmp[sat-1]<'a'||tmp[sat-1]>'z')&&(tmp[sat+strlen(key[j])]<'a'||tmp[sat+strlen(key[j])]>'z'))
							Word[i].num++;
					sat++;
				}
				if(Maxn<Word[i].num)
					Maxn=Word[i].num;
			}
		}
		printf("Excuse Set #%d\n",flag++);
		for(int i=1;i<=t;i++)
			if(Word[i].num==Maxn)
				printf("%s\n",Word[i].str);
		printf("\n");
	}
} 


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Positively Must Know About Unicode and Character Sets (No Excuses!)

by Joel Spolsky Wednesday, October 08, 2003 Ever wonder about that mysterious Content-Type tag? Yo...

HDU 1606(POJ 1598 UVA 409) Excuses, Excuses!(字符串匹配处理)

Excuses, Excuses! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

poj1598Excuses, Excuses!(字符串处理)

Excuses, Excuses! Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3991 ...

uva409 Excuses, Excuses!(字符串处理)

题目戳这里 题目大意: 给出一定量的关键词与一定量的句子,查找含有关键词量最多的句子,并输出,如果是多个句子,一并输出。 注意: 1.关键词在句子中出现必须是单词的形式,关键词是ab的时候在句...

UVA - 409 Excuses, Excuses!

uva 409 Excuses, Excuses!

uva 409 Excuses, Excuses! 题目大意:给出一些借口,再给出一些句子。输出包含最多借口的句子。 注意:有1个以上并列最多时,按输入顺序输出。 借口不能为句子中单词的子串,这样...

UVA 题目409 - Excuses, Excuses!

Excuses, Excuses!  Judge Ito is having a problem with people subpoenaed for jury duty g...

uva 409 Excuses, Excuses!

简单字符串题目,有一点集合的小应用 #include #include #include #include #include using namespace std; #define...

uva 409 - Excuses, Excuses!

给定n个关键词,和m句借口。 找出哪句借口中有最多的关键词。不论大小写。 我先关键词存入一个string数组中,再把每句话中出现的单词存入一个string数组中。然后依次比较,统计出现过的次数。 ...

poj 1598 Excuses, Excuses!

//这题有两点需要注意的:1.有可能excuses中存在着大写字母,这就需要将其大写字母转换为小写字母再比较 //2.keysword不能是excuses中的字串,而是一个单词,具体见下面的样例! ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)