UVA 409 Excuses, Excuses!
2015-08-04 21:01
253 查看
Excuses, Excuses!
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!
yiyi:给出N个关键词,M 个句子。打印含有关键词最多的句子,如果句子中的词为大写,转换成小写时与关键词相同的话也考虑进去。
回复回复
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!
yiyi:给出N个关键词,M 个句子。打印含有关键词最多的句子,如果句子中的词为大写,转换成小写时与关键词相同的话也考虑进去。
#include <stdio.h> #include <string.h> char kw[21][21], jk[21][110]; int match (char word[],int a) { for (int i = 0; i < a; i++) { if (strcmp(kw[i], word) == 0) return 1; } return 0; } int main () { int f, s,i, j, term, max, case1 = 1; int count[21]; char word[21]; while (scanf("%d %d" , &f, &s) != EOF) { max = -1; getchar(); memset(count, 0, sizeof(count)); //输入关键词 for ( i = 0; i < f; i++) { gets(kw[i]); } //输入借口 for ( i = 0; i < s; i++) { gets(jk[i]); int len = strlen(jk[i]); for (j = 0; j < len; ) { //分离单词和大写换小写 term = 0; while ((jk[i][j] >= 'a' && jk[i][j] <= 'z') || (jk[i][j] <= 'Z' && jk[i][j] >= 'A')) { if (jk[i][j] <= 'Z' && jk[i][j] >= 'A') { word[term++] = jk[i][j] - 'A' + 'a'; } else { word[term++] = jk[i][j]; } j++; } j++; word[term] = '\0'; //匹配 if (match(word, f)) count[i]++; } if (max < count[i]) max = count[i]; } printf("Excuse Set #%d\n", case1); case1++; for (i = 0; i < s; i++) { if(max == count[i]) puts(jk[i]); } printf("\n"); } return 0; }
回复回复
相关文章推荐
- 第六篇T语言实例开发,多点找色应用
- BIM建筑信息模型(Building Information Modeling)
- Java中的getResourceAsStream方法
- D2
- Scala 深入浅出实战经典 第48讲:Scala类型约束代码实战及其在Spark中的应用源码解析
- Redis高可用开源缓存集群方案--总结自网络
- Qt4过渡至Qt5
- Android repo sync能否指定目录,貌似没找到解决方案?
- JAVA输入输出流
- HDU1114_Piggy-Bank
- 串结构练习——字符串匹配
- 第六篇T语言实例开发,多点找色应用
- Gradle编译volley
- 斐波那契数列算法及时间复杂度分析
- 汤姆猫
- Codeforces 4C
- 有上下界的最大流解法
- hdu 2844 Coins dp
- 在Win7中运行某些软件时,突然提示出错信息“应用程序无法启动,因为应用程序的并行配置不正确。有关详细信息,请参阅应用程序事件日志,或使用命令行sxstrace.exe工具。”
- Redis Geo:Redis新增位置查询功能