UVA 题目409 - Excuses, Excuses!
来源:互联网 发布:知乎回复越来越长 编辑:程序博客网 时间:2024/04/28 09:27
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 ( ) defines the number of keywords to be used in the search. The second number ( ) 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 ( ) 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 3dogatehomeworkcanarydiedMy 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 5superhighwaycrazythermonuclearbedroomwarbuildingI 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 #1Can you believe my dog died after eating my canary... AND MY HOMEWORK?Excuse Set #2I am having a superhighway built in my bedroom.There was a thermonuclear war!
【代码】:
/********************************** 日期:2013-4-29* 作者:SJF0115* 题号: 题目409 - Excuses, Excuses!* 来源:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=350* 结果:AC* 来源:UVA* 总结:**********************************/#include<stdio.h>#include<string.h>char keywords[21][21];char str[21][101];//匹配int Match(char temp[],int M){for(int i = 0;i < M;i++){if(strcmp(temp,keywords[i]) == 0){//printf("%s",temp);return 1;}}return 0;}int main (){int i,j,M,N,k,Max,MaxIndex,Case = 1;char temp[21];int count[21];//freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin); while(scanf("%d %d\n",&M,&N) != EOF){memset(count,0,sizeof(int)*N);Max = -1;//输入关键词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';//和关键词进行匹配if(Match(temp,M)){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;}
- UVA 题目409 - Excuses, Excuses!
- 字符串训练------UVA 409题目 Excuses, Excuses!
- UVa 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- UVa 409 Excuses! Excuses!
- UVa 409 - Excuses, Excuses!
- uva-409 - Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- uva 409 Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- UVa 409 - Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- uva 409 - Excuses, Excuses!
- UVa - 409 - Excuses, Excuses!
- UVA 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- WINCE多语言接口(MUI)的实现
- 给网页设计师和前端开发者看的前端性能优化
- 基于WINCE6.0系统,SD卡和flash作为PC机的U盘
- YouTube架构学习体会
- 有向图的DFS遍历及判断是否有环(算法导论)
- UVA 题目409 - Excuses, Excuses!
- 基础复习
- WINCE下创建多个文件分区
- 对jQuery的事件绑定的一些思考
- 网页内容爬取:如何提取正文内容
- 回顾MySpace架构的坎坷之路
- wince 下USB 虚拟多个串口问题
- iOS网络编程-ASIHTTPRequest异步请求
- 随机梯度下降(Stochastic Gradient Descend, SGD)算法在大规模数据机器学习问题的使用